The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times

Spliet, Remy; Dabia, Said; Woensel, Tom Van

doi:10.1287/trsc.2016.0705

Cited by 58 publications

(27 citation statements)

References 20 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…(1) Uniform distribution: Let ( ) = 1, where the parameter is randomly chosen from the interval [5,15].…”

Section: Test Instancesmentioning

confidence: 99%

“…where is chosen randomly from the set {2, 3, 4, 5} and is chosen randomly from the interval [15,70].…”

Section: Journal Of Applied Mathematicsmentioning

confidence: 99%

“…In particular, the Time-Dependent Traveling Salesman Problem (TDTSP) seeks to find the shortest tour through the locations when the time to travel depends not only on the distance but also on the time of day the route is traversed. Because the TDTSP incorporates a more realistic touring cost structure, it has been used to model several other applications including scheduling single-machine jobs with time-dependent setup costs [4,5], creating timetables for university exams to minimize backto-back exams [6], production planning for car assembly lines [7], satisfying product demands at minimum travel and purchasing costs [8], and vehicle routing with varying travel times such as within regions of congestion [9][10][11][12][13][14][15]. Vander Wiel and Sahinidis [16,17] note that the TDTSP is NPhard, but little has been published in terms of heuristics, especially heuristics that incorporate a time-dependency.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Comparison of Algorithms for Finding an Efficient Theme Park Tour

Bouzarth

Forrester

Hutson

et al. 2018

Journal of Applied Mathematics

View full text Add to dashboard Cite

The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS). In this paper, we present a mixed-integer linear programming formulation of the TSP-TS and describe a branch-and-cut algorithm based on this model. In addition, we develop a lower bound for the TSP-TS and describe two metaheuristic approaches for obtaining good quality solutions: a genetic algorithm and a tabu search algorithm. Using test instances motivated by actual theme park data, we conduct a computational study to compare the effectiveness of our algorithms.

show abstract

“…(1) Uniform distribution: Let ( ) = 1, where the parameter is randomly chosen from the interval [5,15].…”

Section: Test Instancesmentioning

confidence: 99%

“…where is chosen randomly from the set {2, 3, 4, 5} and is chosen randomly from the interval [15,70].…”

Section: Journal Of Applied Mathematicsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Comparison of Algorithms for Finding an Efficient Theme Park Tour

Bouzarth

Forrester

Hutson

et al. 2018

Journal of Applied Mathematics

View full text Add to dashboard Cite

show abstract

“…It was first put forward by Dantzig and Ramser (1959), proposing a near optimal solution based on a linear programming formulation in the shortest routes [1]. The objective function [1,2] based on total mileage or total cost was widely used in the early stage, and then practical factors, such as vehicle capacity limitation [3], the multi-distribution center [4], the time window [5][6][7], costs of quality deterioration, and carbon emissions [8] were introduced. These factors made the objective conditions of vehicle routing optimization more closely combined with the actual problems.…”

Section: Introductionmentioning

confidence: 99%

Vehicle Routing Optimization of Instant Distribution Routing Based on Customer Satisfaction

Zhang

Yuan

2020

Information

View full text Add to dashboard Cite

Since the actual factors in the instant distribution service scenario are not considered enough in the existing distribution route optimization, a route optimization model of the instant distribution system based on customer time satisfaction is proposed. The actual factors in instant distribution, such as the soft time window, the pay-to-order mechanism, the time for the merchant to prepare goods before delivery, and the deliveryman’s order combining, were incorporated in the model. A multi-objective optimization framework based on the total cost function and time satisfaction of the customer was established. Dual-layer chromosome coding based on the deliveryman-to-node mapping and the access order was conducted, and the nondominated sorting genetic algorithm version II (NSGA-II) was used to solve the problem. According to the numerical results, when time satisfaction of the customer was considered in the instant distribution routing problem, the customer satisfaction increased effectively and the balance between customer satisfaction and delivery cost in the means of Pareto optimization were obtained, with a minor increase in the delivery cost, while the number of deliverymen slightly increased to meet the on-time delivery needs of customers.

show abstract

“…Aracın düğümden çıktığı zaman ne olursa olsun araç bir düğümden ne kadar erken çıkarsa bir sonraki düğüme o kadar erken ulaşacaktır. Spliet vd [31]. 2017 yılında yayınlamış oldukları çalışmada zaman bağımlı araç rotalama problemini zaman penceresi ile birlikte ele almışlardır.…”

unclassified

Zaman bağımlı eş zamanlı topla dağıt araç rotalama problemi için bir matematiksel model

Atasagun¹,

Karaoğlan²

2019

Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi

View full text Add to dashboard Cite

Time dependent vehicle routing problem with simultaneous pickup and delivery is considered  A mixed integer programming formulation is developed for the problem  Performance of the model is tested on test instances In this study, Time Dependent Vehicle Routing Problem with Simultaneous PickUp and Delivery (TD_VRP_SPD) which has not been considered in the literature, is described for the first time and a mathematical model is proposed for the solution of the problem. Experimental studies of the proposed mathematical model are performed on well-known test problems of the literature and the results are interpreted. Performance of the model evaluated computation time and percentage deviations to the optimal solutions. Figure A shows the average of C, R and RC type problems. The results of 112 problems were found to be optimal for 3 problems. All three of these problems are RC type problems. Despite the optimal result in the type of RC problems, the higher gap value indicates the difficulty of the problem.

show abstract

The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times

Abstract: The time window assignment vehicle routing problem with time-dependent travel times Spliet, R.; Dabia, Said; van Woensel, T.

Cited by 58 publications

References 20 publications

A Comparison of Algorithms for Finding an Efficient Theme Park Tour

A Comparison of Algorithms for Finding an Efficient Theme Park Tour

Vehicle Routing Optimization of Instant Distribution Routing Based on Customer Satisfaction

Zaman bağımlı eş zamanlı topla dağıt araç rotalama problemi için bir matematiksel model

Contact Info

Product

Resources

About