High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system

DOI10.1016/j.ejor.2020.07.038zbMath1487.90102OpenAlexW3045890423MaRDI QIDQ2029029

Chao Xu, Amir Gharehgozli, Wenda Zhang

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.038

zbMATH Keywords

polynomial time algorithmlogisticshigh multiplicity ATSP storageOR in maritime industry and warehousingstorage/retrieval system storage

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

Optimizing the number of deployed yard cranes in a container terminal ⋮ Multi-shuttle crane scheduling in automated storage and retrieval systems ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on single crane scheduling in automated storage/retrieval systems
• New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
• Yard crane scheduling for container storage, retrieval, and relocation
• A survey of literature on automated storage and retrieval systems
• Discrete time model and algorithms for container yard crane scheduling
• Warehousing in the e-commerce era: a survey
• Order picking along a crane-supplied pick face: the SKU switching problem
• Integrated storage-order picking systems: technology, performance models, and design insights
• Storage yard operations in container terminals: literature overview, trends, and research directions
• An exact method for scheduling a yard crane
• On the high multiplicity traveling salesman problem
• Kurtosis of the logistic-exponential survival distribution
• The Traveling Salesman Problem with Many Visits to Few Cities
• Designing an optimal turnover-based storage rack for a 3D compact automated storage and retrieval system
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Clustering-based order-picking sequence algorithm for an automated warehouse
• Reducibility among Combinatorial Problems
• Scheduling of Container Storage and Retrieval
• A time- and space-optimal algorithm for the many-visits TSP

This page was built for publication: High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system