Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window

Ong, Johan Oscar; Suprayogi, Suprayogi

doi:10.9744/jti.13.1.1-10

Cited by 10 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cornillier et al [34] and Cornillier et al [35] investigate single-period variants of the complex petrol station replenishment problems presented in Section 3.2, without or with time windows respectively. Ong and Suprayogi [67] consider linehaul and backhaul customers (backhaul customers can be visited after all the linehaul customers in the same trip).…”

Section: Less Influential Characteristicsmentioning

confidence: 99%

Vehicle routing problems with multiple trips

2016

View full text Add to dashboard Cite

This paper presents a survey on the Multi-Trip Vehicle Routing Problem (MTVRP) and on related routing problems where vehicles are allowed to perform multiple trips. The first part of the paper focuses on the MTVRP. It gives an unified view on mathematical formulations and surveys exact and heuristic approaches. The paper continues with variants of the MTVRP and other families of routing problems where multiple trips are sometimes allowed. For the latter, it specially insists on the motivations for having multiple trips and the algorithmic consequences. The expected contribution of the survey is to give a comprehensive overview on a structural property of routing problems that has seen a strongly growing interest in the last few years and that has been investigated in very different areas of the routing literature.

show abstract

Section: Less Influential Characteristicsmentioning

confidence: 99%

Vehicle routing problems with multiple trips

2016

View full text Add to dashboard Cite

show abstract

“…Suprayogi and Mahaputra [14] and Suprayogi and Priyandari [15] discussed the VRPMTTW with simultaneous delivery and pickup. Ong and Suprayogi [16] and Suprayogi et al [17] studied the VRPMTTW with backhauls.…”

Section: Introductionmentioning

confidence: 99%

Comparison Study of Neighborhood Structures in Local Search for Vehicle Routing Problem with Multiple Trips and Time Windows

Kenaka

Suprayogi

2021

jti

View full text Add to dashboard Cite

This paper deals with the vehicle routing problem with multiple trips and time windows (VRPMTTW). The problem combines two features to the basic vehicle routing problem (VRP): multiple trips and time windows. The basic VRP and its variants fall into hard combinatorial optimization problems. Therefore, many heuristics have been developed to solve large problems. Local search (LS) is one of the heuristics using a neighborhood structure in order to find a better solution. This paper focuses on the comparative study of neighborhood structures applied in LS for the VRPMTTW. Two classes of neighborhood structures are compared: Tour-based and permutation-based neighborhood structures. The tour-based neighborhood structures are the neighborhoods in which the moves are performed on the solution represented by a set of tours. The permutation-based neighborhood structures are the neighborhood structures in which the moves are carried out on the solution represented by a permutation of customers. Comparing the performance of the neighborhood structures uses two responses: (1) relative improvement in the objective function value and (2) computation time. The first response is used to measure effectiveness, while the second is used as efficiency. Based on the computational experiment results, it is generally revealed that the permutation-based neighborhood structures used in LS are more effective than the tour-based neighbourhood structures. However, the permutation-based neighborhood structures are less efficient because they give higher computation times.

show abstract

“…Some studies in the VRP with multiple trips and time windows (VRPMTTW) were Suprayogi [17], Suprayogi and Imawati [18], Suprayogi et al [19], Azi et al [20], Suprayogi et al [21], Cattaruzza et al [22], Hernandez et al [23], and Hernandez et al [24]. Ong and Suprayogi [25] investigated the VPTMTTW in context of backhaul operation. The VRP with time windows and simultaneous delivery-pickup (VRPT-WSDP) was studied, for example, by Mingyong and Erbao [26], Fan [27], Wang and Chen [28], Liu et al [29], Avci and Topaloglu [30], and Wang et al [31].…”

Section: Introductionmentioning

confidence: 99%

Tabu Search for the Vehicle Routing Problem with Multiple Trips, Time Windows, and Simultaneous Delivery-Pickup

Suprayogi

Priyandari

2018

jti

View full text Add to dashboard Cite

This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous delivery-pickup (VRPMTTWSDP). This problem is a variant of the basic vehicle routing problem (VRP) including the following characteristics: multiple trips, time windows, and simultaneous delivery-pickup. In this paper, a solution approach based on tabu search (TS) is proposed. In the proposed TS, the sequential insertion (SI) algorithm is used to construct an initial solution. A neighbor structure is generated by applying an operator order consisting of eleven operators of relocation, exchange, and crossover operators. A tabu solution code (TSC) method is applied as a tabu restriction mechanism. Computational experiments are carried out to examine the performance of the proposed TS using hypothetical instances. The performance of the proposed TS is compared to the local search (LS) and the genetic algorithm (GA). The comparison shows that the proposed TS is better in terms of the objective function value.

show abstract

Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window

Cited by 10 publications

References 14 publications

Vehicle routing problems with multiple trips

Vehicle routing problems with multiple trips

Comparison Study of Neighborhood Structures in Local Search for Vehicle Routing Problem with Multiple Trips and Time Windows

Tabu Search for the Vehicle Routing Problem with Multiple Trips, Time Windows, and Simultaneous Delivery-Pickup

Contact Info

Product

Resources

About