RouteArt: A new framework for vehicle routing problem with pickup and delivery using heuristic bubble algorithm

Savran, Akin Ilker; Musaoglu, Erhan; Yuce, Mehmet Fatih; Yeşil, Engin

doi:10.1109/cinti.2014.7028655

Cited by 3 publications

(7 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The vehicles pickup and deliver the orders between the distribution centers without exceeding capacity, time window and pickup-delivery constraints. The Pickup and Delivery Problem with Time Window (PDPTW) problem has similarities with the macro routing problem [3]. In each distribution center, the time spent for loading or unloading the orders causes unexpected delays in the problem.…”

Section: Problem Descriptionmentioning

confidence: 99%

“…In [2,3] a novel model is presented and used in order to state and solve the real-life problem in a better way. In the proposed model used here, each vehicle has a route, a total cost of route, an operating load and a time schedule, and served tasks.…”

Section: B Proposed Problem Modelmentioning

confidence: 99%

“…A novel iterative heuristic algorithm that is called as Heuristic Bubble Algorithm (HBA) was proposed to find solution to daily macro routing problem in [2,3]. The inspiration of the HBA was nature and the division and the union of bubbles are served in the macro routing problem.…”

Section: Heuristic Bubble Algorithmmentioning

confidence: 99%

“…After that the original HBA was enhanced by adding three new operators as the result elimination, the split and the swap operators in the algorithm [3]. In previous two studies, the proposed HBA was used to find solution for only VRPPD problem.…”

Section: Heuristic Bubble Algorithmmentioning

confidence: 99%

“…The VRP was initially presented by Dantzig and Ramser in 1959 and Clarke and Wright in 1964 [2], and it has been researched for years. To solve the real world cases, various appropriate applications for VRP are developed and are used by progressive logistic systems and the expansion of optimization methods [3]. The VRP has different versions in order to consider the details of the problem and the constraints, which include several characteristics of its real world cases, for instance stochastic features, time dependency, and its dynamicity [4].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Extended Heuristic Bubble Algorithm for the Pickup and Delivery Problem with Time Windows

Savran

Musaoglu²,

Yildiz³

et al. 2015

2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI)

Self Cite

View full text Add to dashboard Cite

In this study, the Vehicle Routing Problem Pickup and Delivery with Time Windows (VRPPDTW) is considered. The VRPPDTW problem is seen in many practical applications such as logistics, distribution and transportation. Firstly, a new model of the very close to reallife problem is defined. Secondly, a novel heuristic algorithm with a new objective function is proposed to solve the daily macro routing problem with time windows. The method proposed to solve VRPPDTW problem is an extended version of a nature-inspired algorithm called Heuristic Bubble Algorithm (HBA). In order to express the benefit of using extended HBA, five case studies are discussed using RouteArt. The obtained results provide promising solutions in terms of average vehicle load efficiency, average service time, and total waiting time of the vehicle.I.

show abstract

Section: Problem Descriptionmentioning

confidence: 99%

Section: B Proposed Problem Modelmentioning

confidence: 99%

Section: Heuristic Bubble Algorithmmentioning

confidence: 99%

Section: Heuristic Bubble Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Extended Heuristic Bubble Algorithm for the Pickup and Delivery Problem with Time Windows

Savran

Musaoglu²,

Yildiz³

et al. 2015

2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI)

Self Cite

View full text Add to dashboard Cite

show abstract

An efficient solution to Location-Routing Problems via a two-phase heuristic bubble approach

Savran

Musaoglu²,

Yildiz³

et al. 2015

2015 4th International Conference on Advanced Logistics and Transport (ICALT)

View full text Add to dashboard Cite

Minimizing the average arriving distance in carpooling

Zhao

Yang

Wang

2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The massive use of cars in cities brings several problems such as traffic congestion and air pollution. Carpooling is an effective way to reduce the use of cars on the premise of meeting passenger transport needs. However, route planning will influence the efficiency of carpooling. By now, most researches on the route planning of carpooling mainly pay attention to minimizing the total driving distance of cars, but for passengers, the most crucial thing is to get to the destination as soon as possible. And in most cases, the minimum total driving distance of cars does not mean the minimal average arriving distance of all passengers. To address this issue, in this article, we formulate a novel carpooling route calculation problem with the objective of minimizing the average arriving distance of all passengers in carpooling. Then, we prove that this problem is NP-hard. To solve this problem, for the situation that the vehicle capacity is sufficient to deliver all passengers, we propose a heuristic algorithm named SimilarDirection with [Formula: see text] approximation ratio in delivery order calculation phase, where [Formula: see text] is the capacity of each vehicle. For the situation that the vehicle capacity is insufficient, we provide three algorithms named DelFar, Unchanged, and DelRan. Experimental results show that our SimilarDirection algorithm can produce less average arriving distance of all passengers than other three contrast algorithms in both the real-world dataset experiments and the synthetic dataset experiments, and DelFar has the best performance in producing less average arriving distance when the vehicle capacity is insufficient.

show abstract

RouteArt: A new framework for vehicle routing problem with pickup and delivery using heuristic bubble algorithm

Cited by 3 publications

References 21 publications

Extended Heuristic Bubble Algorithm for the Pickup and Delivery Problem with Time Windows

Extended Heuristic Bubble Algorithm for the Pickup and Delivery Problem with Time Windows

An efficient solution to Location-Routing Problems via a two-phase heuristic bubble approach

Minimizing the average arriving distance in carpooling

Contact Info

Product

Resources

About