A branch-and-price method for the Vehicle Routing Problem with Cross-Docking and Time Windows

One important factor in supply chain management is to efficiently control the supply chain flows. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. Cross-docking is considered a good method to reduce inventory and improv...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Dondo, Rodolfo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2013
Materias:
Ciencias Informáticas
Supply-chain management
Cross-docking
Vehicle routing
Columns generation
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/94327
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-94327
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Supply-chain management
Cross-docking
Vehicle routing
Columns generation
spellingShingle Ciencias Informáticas
Supply-chain management
Cross-docking
Vehicle routing
Columns generation
Dondo, Rodolfo
A branch-and-price method for the Vehicle Routing Problem with Cross-Docking and Time Windows
topic_facet Ciencias Informáticas
Supply-chain management
Cross-docking
Vehicle routing
Columns generation
description One important factor in supply chain management is to efficiently control the supply chain flows. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. Cross-docking is considered a good method to reduce inventory and improve responsiveness. The Vehicle Routing Problem with Cross-Docking and Time Windows (VRP-CD-TW) consists on designing the minimum-cost set of routes to serve a given set of transportation requests while respecting constraints on vehicles capacity, customer time windows and using transfers on a cross-docking base. Each customer must be visited just once and mixed tours comprising pick-up and delivery stops are not allowed. For a given vehicle, the designed pick-up tour must precede its delivery tour. In this work, we model the VRP-CD-TW assuming that all feasible orders are known in advance. We present a new mixed integer program to model the VRP-CD-TW and reformulate it via Dantzig–Wolfe decomposition to later develop a column generation procedure. The proposed branch-and-price algorithm shows encouraging results on solving some Solomon-based instances.
format Objeto de conferencia
Objeto de conferencia
author Dondo, Rodolfo
author_facet Dondo, Rodolfo
author_sort Dondo, Rodolfo
title A branch-and-price method for the Vehicle Routing Problem with Cross-Docking and Time Windows
title_short A branch-and-price method for the Vehicle Routing Problem with Cross-Docking and Time Windows
title_full A branch-and-price method for the Vehicle Routing Problem with Cross-Docking and Time Windows
title_fullStr A branch-and-price method for the Vehicle Routing Problem with Cross-Docking and Time Windows
title_full_unstemmed A branch-and-price method for the Vehicle Routing Problem with Cross-Docking and Time Windows
title_sort branch-and-price method for the vehicle routing problem with cross-docking and time windows
publishDate 2013
url http://sedici.unlp.edu.ar/handle/10915/94327
work_keys_str_mv AT dondorodolfo abranchandpricemethodforthevehicleroutingproblemwithcrossdockingandtimewindows
AT dondorodolfo branchandpricemethodforthevehicleroutingproblemwithcrossdockingandtimewindows
bdutipo_str Repositorios
_version_ 1764820491175985154

Ejemplares similares