A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands

2018 IEEE 30th International Conference on Tools With Artificial Intelligence (ICTAI)

et al. 2018

This paper studies a variant of vehicle routing problem called Selective Pickup and Delivery Problem with Time Windows and Paired Demands (SPDPTWPD). A visiting sequence of each assigned vehicle needs to be determined by respecting the imposed constraints. Like for other combinatorial problems, the optimal solution cannot be obtained in a reasonable time when the size increases. An approached method is thus chosen as an alternative to tackle this issue. The proposed method integrates particle swarm optimization (PSO) with local searches by considering the diversification of PSO and intensification of local search. To validate the method, experiments are made on the benchmarks from the literature. The experiments are divided into two parts. In the first part, a self-comparison is made to demonstrate the evolutionary capacity of PSO and the efficiency of proposed local searches. In the second part, the proposed method is compared with a genetic algorithm from the literature. The results show that the method is competitive and efficient.

“…Then a comparison with genetic algorithm from the literature is made to show the efficiency of the proposed method. The experiments are based on the benchmark proposed in [10].…”

Section: Methodsmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Problem Statementmentioning

confidence: 99%

See 1 more Smart Citation

A Particle Swarm Optimization for Selective Pickup and Delivery Problem

Peng

2018 IEEE 30th International Conference on Tools With Artificial Intelligence (ICTAI)

et al. 2018

“…Concerning the selective aspect of the PDPTWPD, researchers have proposed a linear programming model, based on three-index formulation, to solve this problem [2]. Moreover, a lexicographic approach to solve the biobjective SPDPTWPD has been presented in [1]. Recently, a hybrid genetic algorithm to solve the multi-objective SPDPTWPD has been published in [15] where the aim of our method was to maximize the profit and minimize the distance in the same time.…”

Section: Literature Reviewmentioning

confidence: 99%

A new metaheuristic to solve a selective pickup and delivery problem

Flity

2018 4th International Conference on Logistics Operations Management (GOL)

et al. 2018

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

“…In a previous work, an exact method based on linear programming was used to solve the Selective PDPTWPD (SPDPTWPD) in a mono-objective context [6]. And in another study, a lexicographic approach was developed to address the bi-objectives version of the SPDPTWPD [7]. As the exact approaches were limited to small instances, researchers have also used heuristic ones to solve bigger instances.…”

Section: A Pickup and Delivery Problemmentioning

confidence: 99%

A Robust Pickup and Delivery Problem with Uncertain Travel Time

Bechara

2018 IEEE 30th International Conference on Tools With Artificial Intelligence (ICTAI)

et al. 2018

This paper discusses a robust variant of the well known Pickup and Delivery Problem (PDP) which we called the Robust Selective PDP (RSPDP). In this problem, a fleet composed of several vehicles with a given capacity should satisfy a set of transportation requests while respecting various constraints in relation with the precedence between suppliers and customers, the capacity of vehicles, the opening and closing times of each site. Because of all these constraints, the honoring of all requests over a given period (for example, one day) is sometimes impossible so the selective aspect consists in choosing the sites to be served. This robust variant is characterized by the presence of different scenarios used to handle the uncertain traveling time for each arc. Subject to all scenarios and constraints, the goal is to find the best solution (with the higher profit) which validates all scenarios. This study introduces the mathematical formulation for this new variant. Then, an exact and a metaheuristic approaches will be used to solve it. Several tests have been done, on new generated instances for the considered problem, in order to show the efficiency of developed methods.