Prins Christian

Christian Prins

Information about the author Christian Prins will soon be added to the site.
Found 30 papers in total
Timing problems and algorithms: Time decisions for sequences of activities
2015
Timing problems involve the choice of task execution dates within a predetermined...
A unified solution framework for multi-attribute vehicle routing problems
2014
Vehicle routing attributes are extra characteristics and decisions that complement the...
Time-window relaxations in vehicle routing heuristics
2015
The contribution of infeasible solutions in heuristic searches for vehicle routing...
Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
2014
In the field of high‐value shipment transportation, companies are faced to the...
A survey of recent research on location-routing problems
2014
The design of distribution systems raises hard combinatorial optimization problems....
New Lower Bounds and Exact Method for the m‐PVRP
2013
This paper presents new lower bounding procedures and an exact method for the m...
An effective memetic algorithm for the cumulative capacitated vehicle routing problem
2010
The cumulative capacitated vehicle routing problem (CCVRP) is a transportation problem...
A GRASP×ELS approach for the capacitated location‐routing problem
2010
This paper addresses the capacitated location‐routing problem (CLRP), raised by...
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time‐windows
2013
The paper presents an efficient Hybrid Genetic Search with Advanced Diversity Control...
Solving the two‐echelon location routing problem by a GRASP reinforced by a learning process and path relinking
2012
The two‐echelon location‐routing problem (LRP‐2E) arises from...
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
Recent researches in the design of logistic networks have shown that the overall...
Lower and upper bounds for the m-peripatetic vehicle routing problem
2010
The m -Peripatetic Vehicle Routing Problem ( m -PVRP) consists in finding a set of...
Recent results on Arc Routing Problems: An annotated bibliography
2010
Arc routing problems are vehicle routing problems in which the tasks to be performed...
Tour splitting algorithms for vehicle routing problems
2009
Tour splitting heuristics for capacitated vehicle routing problems build one giant...
Split-delivery capacitated arc-routing problem: Lower bound and metaheuristic
2010
This paper proposes lower and upper bounds for the split-delivery capacitated...
A memetic algorithm for the vehicle routing problem with time windows
2008
This article deals with the vehicle routing problem with time windows (VRPTW). This...
Fast heuristics for a combined production planning and vehicle routing problem
2008
This paper studies a problem of production and distribution of one product on a...
Lower and upper bounds for the mixed capacitated arc routing problem
2006
This paper presents a linear formulation, valid inequalities, and a lower bounding...
A genetic algorithm for a bi-objective capacitated arc routing problem
2006
The capacitated arc routing problem (CARP) is a very hard vehicle routing problem for...
Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
2006
This paper deals with the Bi-Objective Set Covering Problem, which is a generalization...
A scatter search for the periodic capacitated arc routing problem
2006
This paper considers the Periodic Capacitated Arc Routing Problem (PCARP), a natural...
Evolutionary algorithms for periodic arc routing problems
2005
The capacitated arc routing problem (CARP) involves the routing of vehicles to treat a...
Improving robustness of solutions to arc routing problems
2005
This paper considers the stochastic capacitated arc routing problem (SCARP), obtained...
A metaheuristic to solve a location–routing problem with non-linear costs
2005
The paper deals with a location–routing problem with non-linear cost functions....
Papers per page: