Scheduling and routing of automated guided vehicles: A hybrid approach
From MaRDI portal
Publication:858276
DOI10.1016/j.cor.2005.07.004zbMath1159.90400OpenAlexW2067884717MaRDI QIDQ858276
Ayoub Insa Corréa, André Langevin, Louis-Martin Rousseau
Publication date: 9 January 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.004
mathematical programmingconstraint programminghybrid modelmaterial handling systemvehicle routing and schedulinglogical Benders decompositionautomated guided vehicles
Related Items
Scheduling and routing of autonomous moving objects on a mesh topology, Dynamic dispatching for interbay automated material handling with lot targeting using improved parallel multiple-objective genetic algorithm, A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem, A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles, Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19, Decomposition techniques with mixed integer programming and heuristics for home healthcare planning, An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming, A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles, A decision framework for automatic guided vehicle routing problem with traffic congestions, Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda, The Benders decomposition algorithm: a literature review, A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times, Petri net representation and reachability analysis of 0--1 integer linear programming problems, Effective overhead hoist transport dispatching based on the Hungarian algorithm for a large semiconductor FAB
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Design and operational issues in AGV-served manufacturing systems
- Logic-based Benders decomposition
- Constraint and integer programming. Toward a unified methodology.
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. First international conference, CPAIOR 2004, Nice, France, April 20--22, 2004. Proceedings.
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Principles of Constraint Programming
- A semi-dynamic time window constrained routeing strategy in an AGV system
- Developing Conflict-Free Routes for Automated Guided Vehicles
- Dynamic conflict-free routing of automated guided vehicles
- Scheduling and routing algorithms for AGVs: A survey
- Solving large combinatorial problems in logic programming
