A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

Nagata, Yuichi; Bräysy, Olli; Dullaert, Wout

doi:10.1016/j.cor.2009.06.022

Cited by 214 publications

(135 citation statements)

References 30 publications

(75 reference statements)

Supporting

Mentioning

132

Contrasting

Unclassified

Order By: Relevance

“…An effective way to relax the time window constraint and efficiently calculate the time window violation was presented by Nagata et al (2010) and was enhanced by Schneider et al (2013) in the context of VRPTW. A time window penalty (TW) counting the cumulative time needed to travel back in time in order to satisfy the time window constraints is introduced.…”

Section: Concatenation Operators From the Literaturementioning

confidence: 99%

The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

Hiermann

Puchinger

Røpke

et al. 2016

European Journal of Operational Research

419

222

View full text Add to dashboard Cite

Due to new regulations and further technological progress in the field of electric vehicles, the research community faces the new challenge of incorporating the electric energy based restrictions into vehicle routing problems. One of these restrictions is the limited battery capacity which makes detours to recharging stations necessary, thus requiring efficient tour planning mechanisms in order to sustain the competitiveness of electric vehicles compared to conventional vehicles. We introduce the Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and recharging stations (E-FSMFTW) to model decisions to be made with regards to fleet composition and the actual vehicle routes including the choice of recharging times and locations. The available vehicle types differ in their transport capacity, battery size and acquisition cost. Furthermore, we consider time windows at customer locations, which is a common and important constraint in real-world routing and planning problems. We solve this problem by means of branch-and-price as well as proposing a hybrid heuristic, which combines an Adaptive Large Neighbourhood Search with an embedded local search and labelling procedure for intensification. By solving a newly created set of benchmark instances for the E-FSMFTW and the existing single vehicle type benchmark using an exact method as well, we show the effectiveness of the proposed approach.

show abstract

Section: Concatenation Operators From the Literaturementioning

confidence: 99%

The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

Hiermann

Puchinger

Røpke

et al. 2016

European Journal of Operational Research

419

222

View full text Add to dashboard Cite

show abstract

“…The same rule applies to the parameter β with respect to w(s). The initial values of α and β are both set to 1, as suggested by a number of studies that have similar cost functions and weight parameters (Cordeau et al , 1997Ibaraki et al 2008;Nagata et al 2010).…”

Section: Local Search Proceduresmentioning

confidence: 99%

“…However, it takes O(n) to compute the penalties d(s) and w(s) in (13). Nagata et al (2010) propose an evaluation technique to compute the violation of time window constraints in amortized O(1) time for most traditional neighbourhood operators including 2-opt, inter-route swaps, and inter-route inserts. Vidal et al (2013) extend this technique to allow the evaluation of both duration and time windows violations not only for inter-route but also for intra-route operators.…”

Section: Move Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Iterated local search for workforce scheduling and routing problems

2017

View full text Add to dashboard Cite

The integration of scheduling workers to perform tasks with the traditional vehicle routing problem gives rise to the workforce scheduling and routing problems (WSRP). In the WSRP, a number of service technicians with different skills, and tasks at different locations with pre-defined time windows and skill requirements are given. It is required to find an assignment and ordering of technicians to tasks, where each task is performed within its time window by a technician with the required skill, for which the total cost of the routing is minimized. This paper describes an iterated local search (ILS) algorithm for the WSRP. The performance of the proposed algorithm is evaluated on benchmark instances against an off-the-shelf optimizer and an existing adaptive large neighbourhood search algorithm. The proposed ILS algorithm is also applied to solve the skill vehicle routing problem, which can be viewed as a special case of the WSRP. The computational results indicate that the proposed algorithm can produce high-quality solutions in short computation times.

show abstract

“…For the routing in this phase, we implement a simple insertion heuristic to quickly generate solutions for the sample days. We adopt the objective function and the time window handling introduced by Nagata et al (2010), which allows the temporary violation of time window and capacity constraints.…”

Section: Driver Learningmentioning

confidence: 99%

Towards an IT-based Planning Process Alignment: Integrated Route and Location Planning for Small Package Shippers

Stenger

Schneider

Wendt

2011

Theory-Guided Modeling and Empiricism in Information Systems Research

View full text Add to dashboard Cite

To increase the efficiency of delivery operations in small package shipping (SPS), numerous optimization models for route and location planning decisions have been proposed. This "operations research view" of defining independent problems has two major shortcomings: First, most models from literature neglect crucial real-world characteristics, thus making them useless for small package shippers. Second, business processes for strategic decision making are not well-structured in most SPS companies and significant cost savings could be generated by an IT-based support infrastructure integrating decision making and planning across the mutually dependent layers of strategic, tactical and operational planning. We present an integrated planning framework that combines an intelligent data analysis tool, which identifies delivery patterns and changes in customer demand, with location and route planning tools. Our planning approaches extend standard Location Routing and Vehicle Routing models by crucial, practically relevant characteristics like the existence of subcontractors on both decision levels and the implicit consideration of driver familiarity in route planning.

show abstract

A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

Cited by 214 publications

References 30 publications

The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

Iterated local search for workforce scheduling and routing problems

Towards an IT-based Planning Process Alignment: Integrated Route and Location Planning for Small Package Shippers

Contact Info

Product

Resources

About