Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation
| Autor: | Emmanouil Thanos, Greet Van den Berghe, Tony Wauters |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Marketing
021103 operations research Computer science business.industry Strategy and Management ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Management Information Systems Scheduling (computing) Stack (abstract data type) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Routing (electronic design automation) business Metaheuristic Conflict free Computer network |
| Popis: | © 2019, © Operational Research Society 2019. Congested traffic networks impose great difficulties upon scheduling material transportation in industrial settings. Dispatching decisions become complex when, in addition to conflict-free routes, storage location must also be considered. The present paper integrates the dispatch and conflict-free routing of capacitated vehicles with the storage allocation problem and proposes a heuristic approach for minimising the total completion time of box pickup, delivery and relocation requests in a warehouse environment. The developed formulation models a warehouse setting in which boxes are stored in stacks and considers different forward and reverse speeds for the vehicles, real-world movement restrictions and a LIFO loading policy. The proposed approach is evaluated using two different metaheuristics and the results are compared against existing schedules prepared by an industry partner. Experimental results demonstrate the effectiveness of the proposed method for large-scale instances and highlight how improved storage allocation decisions can reduce service times. ispartof: Journal Of The Operational Research Society vol:72 issue:8 pages:1780-1793 status: published |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|