Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints

Felipe, Ángel; Ortuño, M.; Tirado, Gregorio

doi:10.1016/j.ejor.2010.11.011

Cited by 16 publications

(11 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Alba et al (2011) develop a branch-and-cut algorithm to solve the DTSPMS exactly for instances with up to 25 requests. Felipe et al (2011) improve the previously developed VNS in Felipe et al (2009b) by allowing intermediate infeasible solutions. Carrabs et al (2013) consider the double TSP with two stacks.…”

Section: Traveling Salesman Problem With Pickups and Deliveries With mentioning

confidence: 97%

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

Distributors are faced with loading constraints in their route planning, e.g.,multi-dimensional packing constraints, unloading sequence constraints, stability constraints and axle weight limits. Ignoring these constraints impairs planning and induces last-minute changes resulting in additional costs. Developing vehicle routing models incorporating loading constraints is critical to more efficient route planning. The last couple of years has seen a huge increase of contributions to this field of research with almost 60 % of these being published after 2009. Our contribution is twofold. First, we overview the recent developments in the literature on all vehicle types in which loading constraints play a key role (trucks, airplanes, ships, and automated guided vehicles), using a state-of-the-art classification scheme to identify the loading constraints considered in each article. Second, we identify research gaps and opportunities for future research.

show abstract

Section: Traveling Salesman Problem With Pickups and Deliveries With mentioning

confidence: 97%

Vehicle routing problems with loading constraints: state-of-the-art and future directions

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Equation ( 6) restricts the relationship between variable x T ij and variable y T ij . Equation (15) indicates that the decision variable is binary.…”

Section: B Mathematical Formulationmentioning

confidence: 99%

A Double Traveling Salesman Problem With Three-Dimensional Loading Constraints for Bulky Item Delivery

et al. 2021

View full text Add to dashboard Cite

This article considers bulky item delivery problems in which multiple items are retrieved and loaded onto a vehicle from different warehouses and then delivered. This problem is described as a double traveling salesman problem with three-dimensional container loading constraints with multiple stacks. The double TSP with multiple stacks is used to determining the shortest route performing pickups and deliveries in two separated networks (one for pickups and one for deliveries) using only one container. Repacking is not allowed after loading the items into the container. An integer linear programming model is proposed to solve this problem, a standard genetic algorithm and an improved genetic algorithm is designed. In the improved genetic algorithm, a Lin-Kernighan algorithm is used to improve the delivery route, a k-means clustering algorithm, and a heuristic packing scheme improvement rules work together to improve the loading route. The results show that the improved genetic algorithm is superior to the standard genetic algorithm in large scale problems.INDEX TERMS Double traveling salesman problem, three-dimensional container loading, bulky item delivery, genetic algorithm.

show abstract

“…In the final phase, the container is again transferred to a truck which performs the delivery operations . Petersen and Madsen , Felipe et al , and Felipe et al develop heuristic methods to solve the DTSPMS, while Lusby et al , Petersen et al , Lusby and Larsen , Alba et al , and Alba et al propose exact algorithms. Côté et al and Côté et al consider the TSPPD with multiple stacks with LIFO loading.…”

Section: Introductionmentioning

confidence: 99%

Iterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints

et al. 2017

View full text Add to dashboard Cite

In this article an Iterated Local Search algorithm for the capacitated vehicle routing problem with sequencebased pallet loading and axle weight constraints is presented. Axle weight limits impose a great challenge for transportation companies. Yet, the literature on the incorporation of axle weight constraints in vehicle routing models is very scarce. The effect of introducing axle weight constraints in a CVRP on total routing cost is analyzed. Results show that integrating axle weight constraints does not lead to a large cost increase. However, not including axle weight constraints in the planning process may induce major axle weight violations.

show abstract

Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints

Cited by 16 publications

References 19 publications

Vehicle routing problems with loading constraints: state-of-the-art and future directions

Vehicle routing problems with loading constraints: state-of-the-art and future directions

A Double Traveling Salesman Problem With Three-Dimensional Loading Constraints for Bulky Item Delivery

Iterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints

Contact Info

Product

Resources

About