On the Reformulation of Vehicle Routing Problems and Scheduling Problems

Beck, J. Christopher; Prosser, Patrick; Selensky, Evgeny

doi:10.1007/3-540-45622-8_21

Cited by 11 publications

(5 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some scheduling problems can be translated into routing problems, and vice versa [3,4]. However, few problems exhibit both routing and scheduling constraints simultaneously.…”

Section: Literature Reviewmentioning

confidence: 99%

A branch-and-price-and-check model for the vehicle routing problem with location congestion

Lam

Hentenryck

2016

Constraints

View full text Add to dashboard Cite

This paper considers a vehicle routing problem with pickup and delivery, time windows and location congestion. Locations provide a number of cumulative resources that are utilized by vehicles either during service (e.g., forklifts) or for the entirety of their visit (e.g., parking bays). Locations can become congested if insufficient resources are available, upon which vehicles must wait until a resource becomes available before proceeding. The problem is challenging from a computational standpoint since it incorporates the vehicle routing problem and the resource-constrained project scheduling problem. The main contribution of this paper is a branch-and-price-and-check model that uses a branch-and-price algorithm that solves the underlying vehicle routing problem, and a constraint programming subproblem that checks the feasibility of the location resource constraints, and then adds combinatorial nogood cuts to the master problem if the resource constraints are violated. Experimental results show the benefits of the branch-and-price-and-check approach.

show abstract

“…Some scheduling problems can be translated into routing problems, and vice versa [3,4]. However, few problems exhibit both routing and scheduling constraints simultaneously.…”

Section: Literature Reviewmentioning

confidence: 99%

A branch-and-price-and-check model for the vehicle routing problem with location congestion

Lam

Hentenryck

2016

Constraints

View full text Add to dashboard Cite

show abstract

“…A reformulation of the JSP, as a VRP has been presented in (Beck et al, 2002). Both the VRP and the JSP can be considered as a generalization of the Travelling Salesman Problem (TSP).…”

Section: Problem Formulationmentioning

confidence: 99%

A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney DropPoint network

et al. 2018

View full text Add to dashboard Cite

Modern-day logistics companies require increasingly shorter lead-times in order to cater for the increasing popularity of on-demand services. There is consequently an urgent need for fast scheduling algorithms to provide high quality, real-time implementable solutions. In this work we model a spare part delivery problem for an on-demand logistics company, as a variant of vehicle routing problem. For large delivery networks, the optimisation solution technique of column generation has been employed successfully in a variety of vehicle routing settings and is often used in combination with exact methods for solving problems with a large number of variables. Challenges may arise when the pricing subproblem is difficult to solve in a realistic period due to complex constraints or a large number of variables. The problem may become intractable when the network structure varies daily or is known with less certainty over longer period. In such instances, a high quality heuristic solution may be more preferable than an exact solution with excessive run time. We propose an improved version of column generation approach integrating an efficient genetic algorithm to obtain fast and high-quality solutions for a sustainable spare parts delivery problem. More specifically, we propose to retain the traditional column generation iterative framework, with master problem solved exactly, but with pricing subproblem solved using a metaheuristic. Computational results on a real dataset indicate that this approach yields improved solutions compared to the current best-case business-as-usual costs. It also substantially decreases the computational time; allowing for high-quality, tractable solutions to be obtained in few minutes. We propose to strike a balance between the practical and efficient solution aspects of metaheuristic algorithms, and the exact decomposition and iterative aspect of the column generation solution technique.

show abstract

“…A solution is a set of tours for a subset of vehicles such that all customers are served only once and time window and capacity constraints are respected. The objective is to minimize distance travelled, and sometimes additionally to reduce the number of vehicles used [4].…”

Section: The Vehicle Routing Problemmentioning

confidence: 99%

“…Shortest path problems arise in a wide variety of practical problem settings, both as standalone models and as subproblems in more complex problem settings. The shortest path problem is quoted as the most common problem in combinatorial operations research due to its numerous applications as the largest capacity path problem, the quickest path problem, the most reliable path problem, the minimum cost-time ratio problem, the minimum cost-reliability ratio problem, and various routing problems [4].…”

Section: Separate and Single Origin And Destinationmentioning

confidence: 99%

Physical distribution activities and vehicle routing problems in logistics management: A case study

Güneri

2007

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

The vehicle routing path (VRP) is non-deterministic polynomial-time hard (NP-hard) and therefore difficult to solve. The fact that VRP is both of theoretical and practical interest (owing to its real-world applications), explains the amount of attention given to the VRP by researchers during past years. Research on the development of heuristics for the VRP has made considerable progress since the first algorithms were proposed in the early 1960s. Several families of heuristics have been proposed for the VRP. The purpose of this paper is to review some of the most important families of heuristics for the VRP. At the end, the survey presents the solution method used for a small-scale case study in a logistic company in Turkey.

show abstract

On the Reformulation of Vehicle Routing Problems and Scheduling Problems

Cited by 11 publications

References 1 publication

A branch-and-price-and-check model for the vehicle routing problem with location congestion

A branch-and-price-and-check model for the vehicle routing problem with location congestion

A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney DropPoint network

Physical distribution activities and vehicle routing problems in logistics management: A case study

Contact Info

Product

Resources

About