2016
DOI: 10.1109/tcyb.2015.2409837
|View full text |Cite
|
Sign up to set email alerts
|

Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms

Abstract: This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits multiobjective properties in real-world applications. In this paper, a general multiobjective VRPSDPTW (MO-VRPSDPTW) with five objectives is first defined, and then a set of MO-VRPSDPTW instances based on data from th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
47
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 169 publications
(47 citation statements)
references
References 51 publications
0
47
0
Order By: Relevance
“…These solutions will then be applied to form the initial swarm so as to "warmly trigger" the evolutionary process of the proposed algorithm. Following that, we can reduce the computing power of the proposed method to a relatively-small scale (e.g., [ j , max ] = [20,15]) and use it as a near-optimal solution generator in the online process. Significant reduction with respect to the computation time can be achieved if an optimal control solver can start its solution-finding process ar a near-optimal solution (e.g., solutions shown in Fig.5).…”
Section: G Online Performance Of the Proposed Motion Plannermentioning
confidence: 99%
See 2 more Smart Citations
“…These solutions will then be applied to form the initial swarm so as to "warmly trigger" the evolutionary process of the proposed algorithm. Following that, we can reduce the computing power of the proposed method to a relatively-small scale (e.g., [ j , max ] = [20,15]) and use it as a near-optimal solution generator in the online process. Significant reduction with respect to the computation time can be achieved if an optimal control solver can start its solution-finding process ar a near-optimal solution (e.g., solutions shown in Fig.5).…”
Section: G Online Performance Of the Proposed Motion Plannermentioning
confidence: 99%
“…For example, we can model the obstacle to be overtaken as a dynamic object, and this will certainly bring more challenges to the constraint handling process. Moreover, another potential direction could be applying the proposed FAMOPSO algorithm to address more realworld engineering optimization problems, such as the multi-objective vehicle routing problem [15], [21], the multi-agent path planning problem [35], etc.…”
Section: Concluding Remarkmentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper, the idea of MOLS was inspired from the paper of Wang et al (2016) in which the method of resolution is based on a single -objective local search. Therefore, we adopt the same strategy of resolution, by applying two local search algorithms, each search in one direction at a time to minimize one objective.…”
Section: Multiobjective Locale Searchmentioning
confidence: 99%
“…In the field of multiobjective optimization, the set of all the Pareto-optimal solutions is usually called the Pareto set (PS) and the image of (PS) on the objective vector space is called the Pareto front (PF) [30]. Over the past decades, multiobjective evolutionary algorithms (MOEAs) have been recognized as a major methodology for approximating the PF [5], [9], [10], [12], [18], [36]- [38].…”
Section: Introductionmentioning
confidence: 99%