TY - JOUR
T1 - A Study on Multi-objective Vehicle Rounting Problem considering Customer Satisfaction with Due-time (The Creation of Pareto Optimal Solutions by Hybrid Genetic Algorithm)
AU - Sessomboon, Weerapat
AU - Watanabe, Kei
AU - Irohara, Takashi
AU - Yoshimoto, Kazuho
N1 - Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 1998
Y1 - 1998
N2 - In this paper, we proposed a hybrid genetic algorithm (Hybrid GA) approach to a multi, objective vehicle routing problem (MVRP). The objective functions considered in this MVRP are (1). to minimize the number of vehicles used, (2). to minimize the total traveling distance for vehicles, (3). to minimize the total waiting time for vehicles, and (4). to maximize the grade of customer satisfaction with due-time. With respect to customer satisfaction with due-time, we used the concept of fuzzy due-time because it can describe customers' preference with service time better than crisped expression of satisfaction with 0 and 1. To handle such multi-objectivity, a set of Pareto optimal solutions are searched by Hybrid GA. Among Pareto optimal solutions, we furthermore targeted at compromise solutions whose objective functions take almost intermediate values each, in order to produce realistic routing plans for vehicles. In the proposed algorithm, a local search procedure is applied to each solution at each generation for efficient search of solutions. The computational results show that the proposed algorithm is efficient for solving MVRP.
AB - In this paper, we proposed a hybrid genetic algorithm (Hybrid GA) approach to a multi, objective vehicle routing problem (MVRP). The objective functions considered in this MVRP are (1). to minimize the number of vehicles used, (2). to minimize the total traveling distance for vehicles, (3). to minimize the total waiting time for vehicles, and (4). to maximize the grade of customer satisfaction with due-time. With respect to customer satisfaction with due-time, we used the concept of fuzzy due-time because it can describe customers' preference with service time better than crisped expression of satisfaction with 0 and 1. To handle such multi-objectivity, a set of Pareto optimal solutions are searched by Hybrid GA. Among Pareto optimal solutions, we furthermore targeted at compromise solutions whose objective functions take almost intermediate values each, in order to produce realistic routing plans for vehicles. In the proposed algorithm, a local search procedure is applied to each solution at each generation for efficient search of solutions. The computational results show that the proposed algorithm is efficient for solving MVRP.
KW - Compromise Solutions
KW - Design
KW - Fuzzy Due-Time
KW - GA
KW - Hybrid GA
KW - Local Search
KW - MVRP
KW - Pareto Optimal Solutions
KW - Production Management
KW - Production System
KW - System Engineering
KW - Transportation Engineering
UR - http://www.scopus.com/inward/record.url?scp=33645154538&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33645154538&partnerID=8YFLogxK
U2 - 10.1299/kikaic.64.1108
DO - 10.1299/kikaic.64.1108
M3 - Article
AN - SCOPUS:33645154538
SN - 0387-5024
VL - 64
SP - 1108
EP - 1115
JO - Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
JF - Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
IS - 619
ER -