Extended abstract for “Approximate (2008)
Geir Brønmo, Bjørn Nygreen, Jens Lysgaard
column generation for some ship scheduling problems”
Christian H. Christiansen, Richard W. Eglese, Adam N. Letchford, Jens Lysgaard
In this article we introduce and implement a branch-and-cut-and-price algorithm for the Multiple Depot Vehicle Routing Problem with Stochastic Demands. We consider the delivery of a common commodity...
Uchoa, Eduardo, Fukasawa, Ricardo, Lysgaard, Jens, Pessoa, Artur, Poggi De Aragão, Marcus, Andrade, Diego
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation...
Scheduling participants of Assessment Centres (2008)
Assessment Centres are used as a tool for psychologists and coaches to observe a number of dimensions in a person's behaviour and test his/her potential within a number of chosen focus areas. This...
The Pyramidal Capacitated Vehicle Routing Problem (2008)
This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be...
A branch-and-cut algorithm for the capacitated open vehicle routing problem (2007)
Letchford, A.N., Lysgaard, Jens, Eglese, R.W.
nullIn open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open...
Christiansen, Christian Holk, Lysgaard, Jens
nullThis article introduces a new exact algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands (CVRPSD). The CVRPSD can be formulated as a Set Partitioning Problem and it is...
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (2006)
Fukasawa, R., Longo, H., Lysgaard, Jens, Reis, M., Uchoa, E., ...
nullThe best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm...
Christiansen, Christian Holk, Lysgaard, Jens
nullIn this article we introduce a new exact solution approach to the Capacitated Vehicle Routing Problem with Stochastic Demands (CVRPSD). In particular, we consider the case where all customer...
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem (2006)
Letchford, Adam N., Lysgaard, Jens, Eglese, Richard W.
nullIn open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open...
Column generation approaches to ship scheduling with flexible cargo sizes (2006)
Brønmo, Geir, Nygreen, Bjørn, Lysgaard, Jens
nullWe present a Dantzig-Wolfe procedure for the ship scheduling problem with flexible cargo sizes. This problem is similar to the well-known pickup and delivery problem with time windows, but the...
Uchoa, Eduardo, Fukasawa, Ricardo, Lysgaard, Jens, Pessoa, Artur, Poggi De Aragão, Marcus, Andrade, Diogo
nullThis paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a...
Reachability cuts for the vehicle routing problem with time windows (2004)
This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence...
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (2004)
Fukasawa, R., Lysgaard, Jens, Aragão, M. Poggi De, Reis, M., Uchoa, E., Werneck, R.F.
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (2003)
Ricardo Fukasawa, Jens Lysgaard, Marcelo Reis, Marcus Poggi, Aragão Marcelo Reis, ...
The best exact algorithms for the capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that...
A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem (2003)
Jens Lysgaard, Adam N. Letchford, Richard W. Eglese
We present a new branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP). The algorithm uses a variety of cutting planes, including capacity, framed capacity, generalized...
Robust branch-and-cut-and-price for the capacitated vehicle routing problem (2003)
Ricardo Fukasawa, Jens Lysgaard, Marcelo Reis, Eduardo Uchoa, Renato F. Werneck
Abstract. The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an...
A new branch-and-cut algorithm for the capacitated vehicle routing problem (2003)
Adam N. Letchford, Jens Lysgaard, Richard W. Eglese
In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version...
Reachability cuts for the vehicle routing problem with time windows
This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence...
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands
Christiansen, Christian H., Lysgaard, Jens
In this article we introduce a new exact solution approach to the Capacitated Vehicle Routing Problem with Stochastic Demands (CVRPSD). In particular, we consider the case where all customer demands...
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Letchford, Adam N., Lysgaard, Jens, Eglese, Richard W.
In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version...
Column generation approaches to ship scheduling with flexible cargo sizes
Brønmo, Geir, Nygreen, Bjørn, Lysgaard, Jens
We present a Dantzig-Wolfe procedure for the ship scheduling problem with flexible cargo sizes. This problem is similar to the well-known pickup and delivery problem with time windows, but the cargo...
Uchoa, Eduardo, Fukasawa, Ricardo, Lysgaard, Jens, Pessoa, Artur, Poggi De Aragão, Marcus, Andrade, Diogo
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation...
Scheduling participants of Assessment Centres
Assessment Centres are used as a tool for psychologists and coaches to ob- serve a number of dimensions in a person's behaviour and test his/her potential within a number of chosen focus areas. This...
The Pyramidal Capacitated Vehicle Routing Problem
This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be...
Allocating customers to routes with zone costs: A case study.
Logistics; Vehicle routing; Distribution management; Network analysis (planning)
Column generation approaches to ship scheduling with flexible cargo sizes
Brønmo, Geir, Nygreen, Bjørn, Lysgaard, Jens
We present a Dantzig-Wolfe procedure for the ship scheduling problem with flexible cargo sizes. This problem is similar to the well-known pickup and delivery problem with time windows, but the cargo...