The heterogeneous fleet vehicle routing problem with light loads and overtime: Formulation and population variable neighbourhood search with adaptive memory

Simeonova, Lina; Wassan, Niaz A.; Salhi, Saı̈d; Nagy, Gábor

doi:10.1016/j.eswa.2018.07.034

Cited by 24 publications

(3 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, adaptive reordering for VND can be considered in future research. In an adaptive VND, in each iteration the order of the neighborhoods is altered based on the success of the previous iteration [ 33 , 47 ]. Other multi-criteria decision-making methods can also be used to provide a limited number of Pareto solutions to the decision-maker.…”

Section: Discussionmentioning

confidence: 99%

Multi-objective home health care routing: a variable neighborhood search method

2023

View full text Add to dashboard Cite

Health and convenience are two indispensable indicators of the society promotion. Nowadays, to improve community health levels, the comfort of patients and those in need of health services has received much attention. Providing Home Health Care (HHC) services is one of the critical issues of health care to improve the patient convenience. However, manual nurse planning which is still performed in many HHC institutes results in a waste of time, cost, and ultimately lower efficiency. In this research, a multi-objective mixed-integer model is presented for home health care planning so that in addition to focusing on the financial goals of the institution, other objectives that can help increase productivity and quality of services are highlighted. Therefore, four different objectives of the total cost, environmental emission, workload balance, and service quality are addressed. Taking into account medical staff with different service levels, and the preferences of patients in selecting a service level, as well as different vehicle types, are other aspects discussed in this model. The epsilon-constraint method is implemented in CPLEX to solve small-size instances. Moreover, a Multi-Objective Variable Neighborhood Search (MOVNS) composed of nine local neighborhood moves is developed to solve the practical-size instances. The results of the MOVNS are compared with the epsilon-constraint method, and the strengths and weaknesses of the proposed algorithm are demonstrated by a comprehensive sensitivity analysis. To show the applicability of the algorithm, a real example is designed based on a case study, and the results of the algorithm over real data are evaluated.

show abstract

Section: Discussionmentioning

confidence: 99%

Multi-objective home health care routing: a variable neighborhood search method

2023

View full text Add to dashboard Cite

show abstract

“…The variations across heuristics further influence their applicability in specific situations (Bell & Griffis, 2010; Cordeau et al, 2002). As no “standard benchmark” problems yet exist for complex, last‐mile vehicle routing environments (Osaba et al, 2017; Simeonova et al, 2018) we follow the practice of adapting classic benchmark problems to examine vehicle routing in complex systems (Alcaraz et al, 2019). Four separate vehicle routing problem sets provide examples of different urban environments in which to test the heuristics: Christofides et al (1979) problems 1 (Christofides 1) and 11 (Christofides 11) and the Ballou and Agarwal (1988) Cluster 1 (Cluster 1) and RuralUrban 1 (Urban 1) problems.…”

Section: Heuristic Developmentmentioning

confidence: 99%

Inductive research in last‐mile delivery routing: Introducing the Re‐Gifting heuristic

Rose

Bell

Griffis

2022

J of Business Logistics

View full text Add to dashboard Cite

The last-mile problem presents a daunting challenge for many logistics service providers, especially some 7000 small, localized operations for whom the cost of complex software solutions is often prohibitive. As a result, last-mile dispatchers rely on simple heuristics to ensure adequate customer service at an acceptable cost. This research effort extends prior qualitative work by developing and testing a simple vehicle routing heuristic, based on behaviors observed in practice, that prioritizes customer service over cost against other simple vehicle routing heuristics across a variety of environments using simulation. The results support the inclusion of a customer service focus in vehicle routing and the addition of such heuristics to existing algorithm portfolios, specifically in urban areas with well-developed highway systems.

show abstract

“…A multi-cost system is also presented in the following article [33]. Here, the system includes customers and a single depot.…”

Section: Stochastic Vehicle Routingmentioning

confidence: 99%

Mathematical Model for the Generalized VRP Model

2022

View full text Add to dashboard Cite

The Vehicle Routing Problem (VRP) is a highly investigated logistics problem. VRP can model in-plant and out-plant material handling or a whole supply chain. The first Vehicle Routing Problem article was published in 1959 by Dantzig and Ramser, and many varieties of VRP have appeared since then. Transport systems are becoming more and more customized these days, so it is necessary to develop a general system that covers many transport tasks. Based on the literature, several components of VRP have appeared, but the development of an integrated system with all components has not yet been completed by the researchers. An integrated system can be useful because it is easy to configure; many transportation tasks can be easily modeled with its help. Our purpose is to present a generalized VRP model and show, in the form of case studies, how many transport tasks the system can model by including (omitting) each component. In this article, a generalized system is introduced, which covers the main VRP types that have appeared over the years. In the introduction, the basic Vehicle Routing Problem is presented, where the most important Vehicle Routing Problem components published so far are also detailed. The paper also gives the mathematical model of the generalization of the Vehicle Routing Problem and some case studies of the model are presented.

show abstract

The heterogeneous fleet vehicle routing problem with light loads and overtime: Formulation and population variable neighbourhood search with adaptive memory

Cited by 24 publications

References 45 publications

Multi-objective home health care routing: a variable neighborhood search method

Multi-objective home health care routing: a variable neighborhood search method

Inductive research in last‐mile delivery routing: Introducing the Re‐Gifting heuristic

Mathematical Model for the Generalized VRP Model

Contact Info

Product

Resources

About