Questions tagged [vehicle-routing]

For questions related to optimization problems for routing vehicles through a set of nodes, especially the vehicle routing problem (VRP) and its variants.

Filter by
Sorted by
Tagged with
19
votes
5answers
1k views

How to compare two different formulations of a problem?

I somewhat know how to compare two MILP formulations of a problem that both use the same set of decision variables (as in the classical MTZ vs DFJ formulations of the TSP). I was wondering how two ...
17
votes
4answers
654 views

Solving pricing problem heuristically in column generation algorithm for VRP

In the set covering/column generation approach for the VRP (Balinski and Quandt (1964), or e.g. this tutorial), the basic idea is: Generate some routes. Solve the set covering problem using those ...
9
votes
1answer
214 views

Stochastic VRP: Sources of uncertainty and modeling approaches

In one of the archived research topics of mine, I tried to model and solve SVRPs using Multiple Tandem Queues. I have two related questions: What are the sources for uncertainty in Stochastic VRPs? ...
9
votes
1answer
80 views

Two-commodity flow formulation for an asymmetric cost VRP

The two-commodity flow formulation is introduced by Baldacci et al. (2004). It is known for its good performance and providing a tight lower bound. I searched the literature, but couldn't find any ...
10
votes
2answers
176 views

Fast validation of time windows in a routing problem

When solving a routing problem with time windows, unless you go for the arc-based math program that describes it, you have to check time windows "manually." For example, generating routes with any ...
9
votes
1answer
108 views

Capacitated VRP-TW: Gehring & Homberger instances

I am trying to benchmark our vehicle routing solver against Gehring & Homberger instances. However, I got bit puzzled by the route duration constraint (maximum driving / maximum working time). In ...
16
votes
6answers
2k views

List of Implementations for common OR problems

For the TSP there famously is the concord solver (http://www.math.uwaterloo.ca/tsp/concorde.html) which is argubly the fastest exact solver for the TSP. There are many other problems that also show ...
14
votes
3answers
151 views

Solving ATSP problem for large-scale problem

I want to solve the Asymmetric TSP for a large-scale problem for an industrial application where the company cannot buy a commercial software license. For their applications, it is very important to ...