Local and random searches for dispatch and conflict-free routing problem of capacitated AGV systems
- 1 January 2016
- journal article
- Published by Elsevier BV in Computers & Industrial Engineering
- Vol. 91, 1-9
- https://doi.org/10.1016/j.cie.2015.10.017
Abstract
No abstract availableThis publication has 37 references indexed in Scilit:
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loadingComputers & Operations Research, 2015
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraintsEuropean Journal of Operational Research, 2012
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacksNetworks, 2012
- Scheduling and routing of automated guided vehicles: A hybrid approachComputers & Operations Research, 2007
- Static pickup and delivery problems: a classification scheme and surveyTOP, 2007
- Efficient Insertion Heuristics for Vehicle Routing and Scheduling ProblemsTransportation Science, 2004
- Dispatching and Conflict-Free Routing of Automated Guided Vehicles: An Exact ApproachInternational Journal of Flexible Manufacturing Systems, 2003
- Collision Avoidance in Bi-Directional AGV SystemsJournal of the Operational Research Society, 1994
- Counting linear extensionsOrder, 1991
- Classification in vehicle routing and schedulingNetworks, 1981