Near Optimal Solution for Continuous Move Transportation with Time Windows and Dock Service Constraints
Abstract. We consider a pickup and delivery vehicle routing problem (PDP) commonly found in the real-world logistics operations. The problem includes a set of practical complications that have received little attention in the vehicle routing literature. There are multiple vehicle types available to...
Main Authors: | , |
---|---|
Format: | Article in Journal/Newspaper |
Language: | English |
Published: |
Revista Computación y Sistemas; Vol. 16 No. 2
2012
|
Subjects: | |
Online Access: | http://www.repositoriodigital.ipn.mx/handle/123456789/14772 |
id |
ftipnmexicoir:oai:www.repositoriodigital.ipn.mx:123456789/14772 |
---|---|
record_format |
openpolar |
spelling |
ftipnmexicoir:oai:www.repositoriodigital.ipn.mx:123456789/14772 2023-07-16T03:51:44+02:00 Near Optimal Solution for Continuous Move Transportation with Time Windows and Dock Service Constraints Solución casi óptima para transportación de movimiento continúo con restricciones de ventana de tiempo y de servicio de andenes López-Pérez, Fabián Cantú-Aguillén, Carlos 2012-06-05 http://www.repositoriodigital.ipn.mx/handle/123456789/14772 en_US eng Revista Computación y Sistemas; Vol. 16 No. 2 Revista Computación y Sistemas;Vol. 16 No. 2 Revista Computación y Sistemas; Vol. 16 No. 2 1405-5546 http://www.repositoriodigital.ipn.mx/handle/123456789/14772 Keywords. Vehicle routing optimization logistics and transportation planning time windows PDP-TWDS Article 2012 ftipnmexicoir 2023-06-28T10:40:25Z Abstract. We consider a pickup and delivery vehicle routing problem (PDP) commonly found in the real-world logistics operations. The problem includes a set of practical complications that have received little attention in the vehicle routing literature. There are multiple vehicle types available to cover a set of transportation orders with different pickup and delivery time windows. Transportation orders and vehicle types must satisfy a set of compatibility constraints. In addition, we include some dock service capacity constraints as required in real-world operations when there are a large number of vehicles to schedule. This problem requires to be attended on large scale instances: transportation orders ≥ 500, single-haul vehicles ≥ 100. Exact algorithms are not suitable for large scale instances. We propose a model to solve the problem in three stages. The first stage constructs initial solutions at the aggregated level relaxing time windows and dock service constraints of the original problem. The other two stages impose time windows and dock service constraints within a cut generation scheme. Our results are favorable in finding good quality solutions in relatively short computational time. Instituto Politécnico Nacional - Centro de Investigación en Computación (CIC). Investigación en Computación PDF Article in Journal/Newspaper Andenes El Instituto Politécnico Nacional (IPN): Repositorio Digital Institucional (RDI) |
institution |
Open Polar |
collection |
El Instituto Politécnico Nacional (IPN): Repositorio Digital Institucional (RDI) |
op_collection_id |
ftipnmexicoir |
language |
English |
topic |
Keywords. Vehicle routing optimization logistics and transportation planning time windows PDP-TWDS |
spellingShingle |
Keywords. Vehicle routing optimization logistics and transportation planning time windows PDP-TWDS López-Pérez, Fabián Cantú-Aguillén, Carlos Near Optimal Solution for Continuous Move Transportation with Time Windows and Dock Service Constraints |
topic_facet |
Keywords. Vehicle routing optimization logistics and transportation planning time windows PDP-TWDS |
description |
Abstract. We consider a pickup and delivery vehicle routing problem (PDP) commonly found in the real-world logistics operations. The problem includes a set of practical complications that have received little attention in the vehicle routing literature. There are multiple vehicle types available to cover a set of transportation orders with different pickup and delivery time windows. Transportation orders and vehicle types must satisfy a set of compatibility constraints. In addition, we include some dock service capacity constraints as required in real-world operations when there are a large number of vehicles to schedule. This problem requires to be attended on large scale instances: transportation orders ≥ 500, single-haul vehicles ≥ 100. Exact algorithms are not suitable for large scale instances. We propose a model to solve the problem in three stages. The first stage constructs initial solutions at the aggregated level relaxing time windows and dock service constraints of the original problem. The other two stages impose time windows and dock service constraints within a cut generation scheme. Our results are favorable in finding good quality solutions in relatively short computational time. Instituto Politécnico Nacional - Centro de Investigación en Computación (CIC). Investigación en Computación PDF |
format |
Article in Journal/Newspaper |
author |
López-Pérez, Fabián Cantú-Aguillén, Carlos |
author_facet |
López-Pérez, Fabián Cantú-Aguillén, Carlos |
author_sort |
López-Pérez, Fabián |
title |
Near Optimal Solution for Continuous Move Transportation with Time Windows and Dock Service Constraints |
title_short |
Near Optimal Solution for Continuous Move Transportation with Time Windows and Dock Service Constraints |
title_full |
Near Optimal Solution for Continuous Move Transportation with Time Windows and Dock Service Constraints |
title_fullStr |
Near Optimal Solution for Continuous Move Transportation with Time Windows and Dock Service Constraints |
title_full_unstemmed |
Near Optimal Solution for Continuous Move Transportation with Time Windows and Dock Service Constraints |
title_sort |
near optimal solution for continuous move transportation with time windows and dock service constraints |
publisher |
Revista Computación y Sistemas; Vol. 16 No. 2 |
publishDate |
2012 |
url |
http://www.repositoriodigital.ipn.mx/handle/123456789/14772 |
genre |
Andenes |
genre_facet |
Andenes |
op_relation |
Revista Computación y Sistemas;Vol. 16 No. 2 Revista Computación y Sistemas; Vol. 16 No. 2 1405-5546 http://www.repositoriodigital.ipn.mx/handle/123456789/14772 |
_version_ |
1771542188536102912 |