What are the worst cases in constrained Last-In-First-Out pick-up and delivery problems?

Sebastián Urrutia and Dominique de Werra

European Journal of Operational Research, 2018, vol. 270, issue 2, 430-434

Abstract: Pick-up and delivery operations in transportation tasks are usually performed using stacks. The Last-In-First-Out nature of stacks imposes restrictions to the order in which pick-ups and deliveries are performed. In this paper, we study the problem of determining the minimum number of stacks needed to perform given sequences of pick-up and delivery operations. We consider both, limited and unlimited capacity stacks and allow some transformations on the delivery route. These problems amount to computing the smallest bounded chromatic number in a family of permutation graphs. We study the worst cases of these problems.

Keywords: Combinatorial optimization; Pick-up and delivery; Permutation graphs; Bounded chromatic number (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221718303084
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:270:y:2018:i:2:p:430-434

DOI: 10.1016/j.ejor.2018.04.005

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().