Application of a variable neighborhood search algorithm to a fleet size and mix vehicle routing problem with electric modular vehicles

Rezgui, Dhekra; Siala, Jouhaina Chaouachi; Aggoune-Mtalaa, Wassila; Bouziri, Hend

doi:10.1016/j.cie.2019.03.001

Cited by 58 publications

(9 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For these reasons, the choice of appropriate neighborhood structures/operators for local search and for shaking is crucial. So far, VNS has shown state-of-the-art performance for a wide range of optimization problems, including the facility layout problem [42], scheduling problems [43][44][45], portfolio optimization [46,47], assembly and disassembly line balancing [48] and various routing problems [49][50][51][52].…”

Section: Variable Neighborhood Search For the 2e-evrp-twmentioning

confidence: 99%

Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows

et al. 2022

View full text Add to dashboard Cite

Increasing environmental concerns and legal regulations have led to the development of sustainable technologies and systems in logistics, as in many fields. The adoption of multi-echelon distribution networks and the use of environmentally friendly vehicles in freight distribution have become major concepts for reducing the negative impact of urban transportation activities. In this line, the present paper proposes a two-echelon electric vehicle routing problem. In the first echelon of the distribution network, products are transported from central warehouses to satellites located in the surroundings of cities. This is achieved by means of large conventional trucks. Subsequently, relatively smaller-sized electric vehicles distribute these products from the satellites to demand points/customers located in the cities. The proposed problem also takes into account the limited driving range of electric vehicles that need to be recharged at charging stations when necessary. In addition, the proposed problem considers time window constraints for the delivery of products to customers. A mixed-integer linear programming formulation is developed and small-sized instances are solved using CPLEX. Furthermore, we propose a constructive heuristic based on a modified Clarke and Wright savings heuristic. The solutions of this heuristic serve as initial solutions for a variable neighborhood search metaheuristic. The numerical results show that the variable neighborhood search matches CPLEX in the context of small problems. Moreover, it consistently outperforms CPLEX with the growing size and difficulty of problem instances.

show abstract

Section: Variable Neighborhood Search For the 2e-evrp-twmentioning

confidence: 99%

Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows

et al. 2022

View full text Add to dashboard Cite

show abstract

“…An adaptive large neighbourhood search (ALNS) is proposed to solve large-scale test instances. Rezgui et al [58] consider the joint fleet-size and routing optimization problem for modular electric vehicles. A variable neighborhood descent heuristic is proposed for larger extended Solomon's instances with up to 400 customers and hundreds of vehicles.…”

Section: Fleet Size and Configurationmentioning

confidence: 99%

Survey of charging management and infrastructure planning for electrified demand-responsive transport systems: Methodologies and recent developments

Fang

2022

Eur. Transp. Res. Rev.

View full text Add to dashboard Cite

The accelerated electrification of transport systems with EVs has brought new challenges for charging scheduling, fleet management, and charging infrastructure location and configuration planning. In this review, we have provided a systematic review of the recent development in strategic, tactical, and operational decisions for demand responsive transport system planning using electric vehicles (EV-DRT). We have summarized recent developments in mathematical modeling approaches by focusing on the problems of dynamic EV-DRT optimization, fleet sizing, and charging infrastructure planning. A list of existing open-access datasets, numerical test instances, and software are provided for future research in EV-DRT and related problems. Current research gaps are identified and future research directions are discussed.

show abstract

“…The problem of vehicle routing was primarily announced by Dantzig and Ramser ( 1959 ), which later became a crucial problem in distribution management. Famous VRPs (Huang et al 2019 ; Rezgui et al 2019 ) sought to make progress in the economic influence of vehicle routes on the distribution of goods. From the other point of view, transportation technologies play a noteworthy role in air pollution.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Furthermore, with the aiming of raising efficiency in transportation and logistics systems, the problem of vehicle routing and suggesting reliable and efficacious solutions to give services to customers has been proposed and implemented. The famous VRPs (Huang et al 2019 ; Rezgui et al 2019 ) that first of all improve the economic impact of vehicle routes in the distribution of goods. Hence, in this work, have considered two types of VRP, which include green VRP and VRP for perishable products (Xu et al 2019 ; Utama et al 2020 ).…”

Section: Introductionmentioning

confidence: 99%

Optimization and incorporating of green traffic for dynamic vehicle routing problem with perishable products

Talouki

Javadian

Movahedi

2021

Environ Sci Pollut Res

View full text Add to dashboard Cite

In view of the significance of transportation management and logistics in the economic concept and raising the productivity of production systems, well-timed procurement of perishable materials and goods is determined as a pivotal prerequisite for economic and environmental development. Since the perishable goods produced must be made delivered to consumers as early as possible on account of the limited lifespan, thus, the vulnerability of these products is extremely high, owing to the high cost of transportation as well as the environmental impacts. So that solves this problem, this study represents a problem of dynamic green vehicle routing of perishable products in green traffic conditions that optimizes the total cost for a dynamic transportation network and minimizes environmental influences, and increases customer satisfaction. The introduced model is implemented in light of time windows as a trustworthy solution for monitoring the dynamic logistics process and attaining instantaneous information on the basis of the green traffic situation and travel duration, which is commonly known by the Logit function. Assuming the three-objective programming model, we consider a new improved algorithm developed for a novel augmented ε-constraint heuristic approach. Furthermore, robust optimization has been conducted for the established problem to tackle with uncertainties. Uncertainties are included demand and economic parameters. Eventually, to validate the proposed model, a case study was carried out at Kaleh Amol Dairy Company in Iran. The conclusions of sensitivity analysis by implementing the model in the real world indicate that the model and approach presented in various uncertainty scenarios have high flexibility.

show abstract

Application of a variable neighborhood search algorithm to a fleet size and mix vehicle routing problem with electric modular vehicles

Cited by 58 publications

References 29 publications

Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows

Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows

Survey of charging management and infrastructure planning for electrified demand-responsive transport systems: Methodologies and recent developments

Optimization and incorporating of green traffic for dynamic vehicle routing problem with perishable products

Contact Info

Product

Resources

About