Multiobjective Local Search Based Hybrid Algorithm for Vehicle Routing Problem with Soft Time Windows

Bouchra, Bouziyane; Dkhissi, Btissam; Cherkaoui, Mohammad

doi:10.1007/978-3-319-96292-4_25

Cited by 3 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Karoonsoontawong [31] studied the multitrip time-varying vehicle route problem with soft time windows and timeout constraints and proposed improving recursive multiobjective planning and equivalent single-objective planning. Bouchra [32] proposed an improved multiobjective local search algorithm based on a hybrid approach in order to optimize multiple mutually opposing objectives simultaneously. Zare-Reisabadi [33] proposed a local search ant colony algorithm and forbidden search algorithm.…”

Section: Literature Reviewmentioning

confidence: 99%

Routes Choice in the International Intermodal Networks under the Soft Time Window

Xiao

Gong

Wang

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

There are many transportation nodes in multimodal transport. It is more in line with the actual transportation situation to reasonably select the transportation mode from the perspective of the elastic constraint of arrival time. Considering the elastic constraint of arrival time, the soft time window factor is brought into the research of multimodal transport route optimization, the route optimization model is established, and the appropriate genetic algorithm is selected and designed to deal with it. So as to obtain the optimal transportation scheme of multimodal transport, multimodal transport system optimization involves many factors such as multimodal transport organization, policy, process, responsibility, coordination, and environment.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Routes Choice in the International Intermodal Networks under the Soft Time Window

Xiao

Gong

Wang

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…This section briefly reviews the basic concepts of a multiobjective optimization problem (MOP), and presents the mathematical model of the problem (Bouchra et al, 2018).…”

Section: Problem Descriptionmentioning

confidence: 99%

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem

Bouchra¹,

Dkhissi²,

Cherkaoui³

2020

10.5267/j.ijiec

View full text Add to dashboard Cite

This paper is interested in pharmaceuticals distribution which is one of the most important activities and ensures the availability of drug products to a set of customers (pharmacies). The study introduces the Disrupted Vehicle Routing problem with Soft Time Windows since pharmaceutical distributors should respond to increased demands for products to ensure timely and efficient delivery to dynamic demands. We also propose an improved multiobjective local search (IMOLS), which uses methods of neighborhood search such as large neighborhood search (LNS) and variable neighborhood search (VNS) based on a hybrid approach in the optimization of vehicle routes. The algorithm is expected to achieve competitive results compared with previously published studies.

show abstract

“…It was first put forward by Dantzig and Ramser (1959), proposing a near optimal solution based on a linear programming formulation in the shortest routes [1]. The objective function [1,2] based on total mileage or total cost was widely used in the early stage, and then practical factors, such as vehicle capacity limitation [3], the multi-distribution center [4], the time window [5][6][7], costs of quality deterioration, and carbon emissions [8] were introduced. These factors made the objective conditions of vehicle routing optimization more closely combined with the actual problems.…”

Section: Introductionmentioning

confidence: 99%

Vehicle Routing Optimization of Instant Distribution Routing Based on Customer Satisfaction

Zhang

Yuan

2020

Information

View full text Add to dashboard Cite

Since the actual factors in the instant distribution service scenario are not considered enough in the existing distribution route optimization, a route optimization model of the instant distribution system based on customer time satisfaction is proposed. The actual factors in instant distribution, such as the soft time window, the pay-to-order mechanism, the time for the merchant to prepare goods before delivery, and the deliveryman’s order combining, were incorporated in the model. A multi-objective optimization framework based on the total cost function and time satisfaction of the customer was established. Dual-layer chromosome coding based on the deliveryman-to-node mapping and the access order was conducted, and the nondominated sorting genetic algorithm version II (NSGA-II) was used to solve the problem. According to the numerical results, when time satisfaction of the customer was considered in the instant distribution routing problem, the customer satisfaction increased effectively and the balance between customer satisfaction and delivery cost in the means of Pareto optimization were obtained, with a minor increase in the delivery cost, while the number of deliverymen slightly increased to meet the on-time delivery needs of customers.

show abstract

Multiobjective Local Search Based Hybrid Algorithm for Vehicle Routing Problem with Soft Time Windows

Cited by 3 publications

References 19 publications

Routes Choice in the International Intermodal Networks under the Soft Time Window

Routes Choice in the International Intermodal Networks under the Soft Time Window

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem

Vehicle Routing Optimization of Instant Distribution Routing Based on Customer Satisfaction

Contact Info

Product

Resources

About