An exact algorithm for the full truckload pick-up and delivery problem with time windows: concept and implementation details

Janssens, Gerrit K.; Braekers, Kris

doi:10.1504/ijcaet.2015.068334

Cited by 3 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From a practical viewpoint, this case is mostly relevant in container transport, which is abstractly formulated as the full-truckload pick-up and delivery problem (FT-PDPTW) (Erera and Smilowitz, 2008;Janssens and Braekers, 2011). It has been shown that a problem of the type FT-PDPTW can be transformed into an asymmetric multiple travelling salesmen problem Downloaded by [New York University] at 07:09 11 June 2015 with time windows by collapsing each time request into a single node (Wang and Regan, 2002).…”

Section: Literature Reviewmentioning

confidence: 99%

A Hybrid Algorithm for the Vehicle Routing Problem with Soft Time Windows and Hierarchical Objectives

Manisri¹,

Mungwattana²,

Janssens³

et al. 2015

Journal of Information and Optimization Sciences

Self Cite

View full text Add to dashboard Cite

This paper presents an algorithm for the vehicle routing problem with soft time windows (VRPSTW). It involves serving a set of customers, with earliest and latest time deadlines, which may be violated if a penalty is paid, and a constant service time at the customer site. Customer demands are served by capacitated vehicles. The purpose of this research is to develop a hybrid algorithm that includes an insertion heuristic, a local search algorithm and a meta-heuristic algorithm to solve VRPSTW problems with more than one objective. The first priority aims to find the minimum number of vehicles required and the second priority aims to search for the solution that minimizes the total travel time. Performance of the algorithmic approach is measured by two criteria: solution quality and *284 T. MANISRI, A. MUNGWATTANA, G. K. JANSSENS AND A. CARIS run time. A set of well-known benchmark data and a genetic algorithm are used to compare the solution quality and running time of the algorithm. Results show a trade-off can be made between total cost and service when considering soft time windows. Running time results display that the hybrid algorithm has a higher performance than the genetic algorithm when the number of customers is less than 25.

show abstract

Section: Literature Reviewmentioning

confidence: 99%