IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v68y2017i11d10.1057_s41274-016-0152-9.html
   My bibliography  Save this article

A note on a mixed routing and scheduling problem on a grid graph

Author

Listed:
  • Marisa Cenci

    (University of Rome III)

  • Mirko Giacomo

    (University of Rome III)

  • Francesco Mason

    (University of Venice)

Abstract

We consider a particular case of the Fleet Quickest Routing Problem (FQRP) on a grid graph of m × n nodes that are placed in m levels and n columns. Starting nodes are placed at the first (bottom) level, and nodes of arrival are placed at the mth level. A feasible solution of FQRP consists in n Manhattan paths, one for each vehicle, such that capacity constraints are respected. We establish m*, i.e. the number of levels that ensures the existence of a solution to FQRP in any possible permutation of n destinations. In particular, m* is the minimum number of levels sufficient to solve any instance of FQRP involving n vehicles, when they move in the ways that the literature has until now assumed. Existing algorithms give solutions that require, for some values of n, more levels than m*. For this reason, we provide algorithm CaR, which gives a solution in a graph m* × n, as a minor contribution.

Suggested Citation

  • Marisa Cenci & Mirko Giacomo & Francesco Mason, 2017. "A note on a mixed routing and scheduling problem on a grid graph," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1363-1376, November.
    • Handle: RePEc:pal:jorsoc:v:68:y:2017:i:11:d:10.1057_s41274-016-0152-9
    DOI: 10.1057/s41274-016-0152-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/s41274-016-0152-9
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-016-0152-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ángel Marín, 2006. "Airport management: taxi planning," Annals of Operations Research, Springer, vol. 143(1), pages 191-202, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mirko Giacomo & Francesco Mason & Marisa Cenci, 2020. "A note on solving the Fleet Quickest Routing Problem on a grid graph," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 1069-1090, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guépet, J. & Briant, O. & Gayon, J.P. & Acuna-Agost, R., 2016. "The aircraft ground routing problem: Analysis of industry punctuality indicators in a sustainable perspective," European Journal of Operational Research, Elsevier, vol. 248(3), pages 827-839.
    2. Mirko Giacomo & Francesco Mason & Marisa Cenci, 2020. "A note on solving the Fleet Quickest Routing Problem on a grid graph," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 1069-1090, September.
    3. Hang Zhou & Xinxin Jiang, 2015. "Research on Taxiway Path Optimization Based on Conflict Detection," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-17, July.
    4. Samà, Marcella & D’Ariano, Andrea & D’Ariano, Paolo & Pacciarelli, Dario, 2017. "Scheduling models for optimal aircraft traffic control at busy airports: Tardiness, priorities, equity and violations considerations," Omega, Elsevier, vol. 67(C), pages 81-98.
    5. Samà, Marcella & D'Ariano, Andrea & Corman, Francesco & Pacciarelli, Dario, 2018. "Coordination of scheduling decisions in the management of airport airspace and taxiway operations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 114(PB), pages 398-411.
    6. Yin, Suwan & Han, Ke & Ochieng, Washington Yotto & Sanchez, Daniel Regueiro, 2022. "Joint apron-runway assignment for airport surface operations," Transportation Research Part B: Methodological, Elsevier, vol. 156(C), pages 76-100.
    7. Jianan Yin & Minghua Hu & Yuanyuan Ma & Ke Han & Dan Chen, 2019. "Airport Taxi Situation Awareness with a Macroscopic Distribution Network Analysis," Networks and Spatial Economics, Springer, vol. 19(3), pages 669-695, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:68:y:2017:i:11:d:10.1057_s41274-016-0152-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.