Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
A Bi-Objective Vehicle-Routing Problem with Soft Time Windows and Multiple Depots to Minimize the Total Energy Consumption and Customer Dissatisfaction
In recent years, the impact of the energy crisis and environment pollution on quality of life has forced industry to actively participate in the development of a sustainable society. Simultaneously, customer satisfaction improvement has always been a goal of businesses. It is recognized that efficient technologies and advanced methods can help transportation companies find a better balance between progress in energy saving and customer satisfaction. This paper investigates a bi-objective vehicle-routing problem with soft time windows and multiple depots, which aims to simultaneously minimize total energy consumption and customer dissatisfaction. To address the problem, we first develop mixed-integer programming. Then, an augmented -constraint method is adopted to obtain the optimal Pareto front for small problems. It is very time consuming for the augmented -constraint method to precisely solve even medium-sized problems. For medium- and large-sized problems, two Non-dominated Sorting Genetic Algorithm-II (NSGA-II)-based heuristics with different rules for generating initial solutions and offspring are designed. The performance of the proposed methods is evaluated by 100 randomly generated instances. Computational results show that the second NSGA-II-based heuristic is highly effective in finding approximate non-dominated solutions for small-size and medium-size instances, and the first one is performs better for the large-size instances.
A Bi-Objective Vehicle-Routing Problem with Soft Time Windows and Multiple Depots to Minimize the Total Energy Consumption and Customer Dissatisfaction
In recent years, the impact of the energy crisis and environment pollution on quality of life has forced industry to actively participate in the development of a sustainable society. Simultaneously, customer satisfaction improvement has always been a goal of businesses. It is recognized that efficient technologies and advanced methods can help transportation companies find a better balance between progress in energy saving and customer satisfaction. This paper investigates a bi-objective vehicle-routing problem with soft time windows and multiple depots, which aims to simultaneously minimize total energy consumption and customer dissatisfaction. To address the problem, we first develop mixed-integer programming. Then, an augmented -constraint method is adopted to obtain the optimal Pareto front for small problems. It is very time consuming for the augmented -constraint method to precisely solve even medium-sized problems. For medium- and large-sized problems, two Non-dominated Sorting Genetic Algorithm-II (NSGA-II)-based heuristics with different rules for generating initial solutions and offspring are designed. The performance of the proposed methods is evaluated by 100 randomly generated instances. Computational results show that the second NSGA-II-based heuristic is highly effective in finding approximate non-dominated solutions for small-size and medium-size instances, and the first one is performs better for the large-size instances.
A Bi-Objective Vehicle-Routing Problem with Soft Time Windows and Multiple Depots to Minimize the Total Energy Consumption and Customer Dissatisfaction
Shijin Wang (Autor:in) / Xiaodong Wang (Autor:in) / Xin Liu (Autor:in) / Jianbo Yu (Autor:in)
2018
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Collaborative Multidepot Vehicle Routing Problem with Dynamic Customer Demands and Time Windows
| DOAJ | 2022
Reducing Carbon Emissions for the Vehicle Routing Problem by Utilizing Multiple Depots
| DOAJ | 2022
An Algorithm for Vehicle Routing Problem with Soft Time Windows Using Tabu Search
| British Library Conference Proceedings | 2009
VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND SPLIT DELIVERIES
| TIBKAT | 2009