Recent progress of local search in handling the time window constraints of the vehicle routing problem

Hashimoto, Hideki; Yagiura, Mutsunori; Imahori, Shinji; Ibaraki, Toshihide

doi:10.1007/s10288-010-0144-6

Cited by 31 publications

(6 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea behind this method is partially based on existing methods for non-convex piecewise linear cost functions (for an overview we refer to Vidal et al (2015) and Hashimoto et al (2013)). However, these methods only deal with a single objective (minimizing the total cost function) and therefore cannot be applied directly in our bi-objective setting.…”

Section: Scheduling Of a Single Routementioning

confidence: 99%

A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience

Braekers

Hartl

Parragh

et al. 2016

European Journal of Operational Research

224

139

View full text Add to dashboard Cite

Highlights• First bi/multi-objective model for the home care routing and scheduling problem• Insight in and analysis of the trade-off between costs and client inconvenience • A metaheuristic algorithm based on Multi-Directional Local Search• Numerical experiments on new benchmark instances based on real-life data • The trade-off is substantial, indicating the need for well-considered decisions AbstractOrganizations providing home care services are inclined to optimize their activities in order to meet the constantly increasing demand for home care. In this context, home care providers are confronted with multiple, often conflicting, objectives such as minimizing their operating costs while maximizing the service level offered to their clients by taking into account their preferences. This paper is the first to shed some light on the trade-off relationship between these two objectives by modeling the home care routing and scheduling problem as a biobjective problem. The proposed model accounts for qualifications, working regulations and overtime costs of the nurses, travel costs depending on the mode of transportation, hard time windows, and client preferences on visit times and nurses. A distinguishing characteristic of the problem is that the scheduling problem for a single route is a bi-objective problem in itself, thereby complicating the problem considerably. A metaheuristic algorithm, embedding a large neighborhood search heuristic in a multi-directional local search framework, is proposed to the solve the problem. Computational experiments on a set of benchmark instances based on real-life data are presented. A comparison with exact solutions on small instances shows that the algorithm performs well. An analysis of the results reveals that service providers face a considerable trade-off between costs and client convenience. However, starting from a minimum cost solution, the average service level offered to the clients may already be improved drastically with limited additional costs.

show abstract

Section: Scheduling Of a Single Routementioning

confidence: 99%

A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience

Braekers

Hartl

Parragh

et al. 2016

European Journal of Operational Research

224

139

View full text Add to dashboard Cite

show abstract

“…Interested readers are referred to surveys (e.g. see Bräysy and Gendreau (2005a,b), and Hashimoto et al (2010)) of the existing literature on VRPTW, TSPTW, their solution methodologies, and applications.…”

Section: International Journal Of Production Research 3655mentioning

confidence: 99%

Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains

Jula

Kones

2013

International Journal of Production Research

View full text Add to dashboard Cite

In this paper we address the problem of selecting and scheduling several jobs on a single machine with sequence-dependent setup times and strictly enforced time window constraints on the start time of each job. We use short-term production targets to coordinate decentralised local schedulers and to make the objectives of specific areas in line with the chain objectives by maintaining a desired work in process profile in manufacturing environments. The existing literature in this domain is based on discrete-time approaches. We depart from prior approaches by considering continuous time. We introduce a two-step mathematical programming model based on disjunctive constraints to solve small problems to optimality, and propose an insertion-based heuristic to solve large-scale instances. We provide several variations of the insertion heuristic based on different score functions. The primary objective of these approaches is to maximise the total defined score for jobs while satisfying production targets for families of jobs in each shift. Further, our models minimise the maximum completion time of all selected jobs. The effectiveness, efficiency, and robustness of the proposed algorithms are analysed and compared with the existing literature.

show abstract

“…Time-dependent VRP was then investigated more rigorously by (Soler et al, 2009), who incorporated time windows into the model. More realistic ramifications of this type of problem were recently developed by (Hashimoto et al, 2010) (Kritzinger et al, 2012), and (Kok et al, 2012). They focused on hard and soft time windows, impacts of traffic information, and congestion avoidance in time-dependent VRP with time windows.…”

Section: Literature Reviewmentioning

confidence: 99%

A green perspective on capacitated time-dependent vehicle routing problem with time windows

Kazemian

Aref

2017

IJSCIM

View full text Add to dashboard Cite

This study presents a novel approach to the vehicle routing problem by focusing on greenhouse gas emissions and fuel consumption aiming to mitigate adverse environmental effects of transportation. A time-dependent model with time windows is developed to incorporate speed and schedule in transportation. The model considers speed limits for different times of the day in a realistic delivery context. Due to the complexity of solving the model, a simulated annealing algorithm is proposed to find solutions with high quality in a timely manner. Our method can be used in practice to lower fuel consumption and greenhouse gas emissions while total route cost is also controlled to some extent. The capability of method is depicted by numerical examples productively solved within 3.5% to the exact optimal for small and mid-sized problems.Moreover, comparatively appropriate solutions are obtained for large problems in averagely one tenth of the exact method restricted computation time.

show abstract

Recent progress of local search in handling the time window constraints of the vehicle routing problem

Cited by 31 publications

References 55 publications

A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience

A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience

Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains

A green perspective on capacitated time-dependent vehicle routing problem with time windows

Contact Info

Product

Resources

About