Thirty years of heterogeneous vehicle routing

Koç, Çağrı; Bektaş, Tolga; Jabali, Ola; Laporte, Gilbert

doi:10.1016/j.ejor.2015.07.020

Cited by 208 publications

(81 citation statements)

References 134 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…HFVVRP with Time windows digunakan untuk meyelesaikan permasalahan yang terdiri terdiri dari menentukan rute kendaraan yang mana pelanggan dikunjungi tepat satu kali oleh kendaraan dalam waktu yang telah ditentukan, semua kendaraan memulai dan mengakhiri rute di titik awal pengiriman dan beban setiap kendaraan tidak melebihi kapasitas kendaraan [1]. Evolutionary Algorithm merupakan metode penyelesaian yang digunakan untuk menentukan rute HFVRPTW.…”

Section: Metode Penelitianunclassified

Optimasi Rute Pengiriman dengan Heterogeneous Fleet Vehicle Routing Problem with Time Windows

Hendrawan

Widyadana

2018

j. sist. manaj. ind.

View full text Add to dashboard Cite

PT. X merupakan distributor suku cadang dengan 128 pelanggan untuk Kota Surabaya dan Kota Sidoarjo. Jumlah kendaraan pengirim yang dimiliki oleh PT. X adalah 15. Penentuan rute pengiriman yang dimiliki oleh PT. X dilakukan secara manual, berdasarkan pengalaman pengemudi. Penelitian ini bertujuan membuat sebuah model penentuan rute dengan biaya minimum dengan mempertimbangkan waktu tempuh dan kapasitas kendaraan. A B S T R A C T Keywords:Evolutionary Algorithm HFVRP with Time Windows Rute Vehicle Routing Problem PT. X is a distributor of spare parts with 128 customers for Surabaya City and Sidoarjo City. Number of delivery vehicles owned by PT. X is 15. Determination of delivery route owned by PT. X is completed manually based on driver experience. This research is to make a model of determining the route with minimum cost by considering the travel time and the capacity of the vehicle. Model formation is accomplished in accordance with the PT X policy that each colleague can only be served by one vehicle and the maximum shipping time of 7 hours. The model formed is Heterogeneous Fleet Vehicle Routing Problem with Time Windows (HFVRPWTW). The settlement method used is Evolutionary Algorithm (EA) by reviewing 3 cases. The number of vehicles decreased by the model is with an average difference of 1.67 vehicles. The shipping cost generated by the model is lower than the company for case 1 of 3,155 IDR and case 2 of 25,005 IDR. This condition indicates the model will use less number of vehicles with low shipping costs and large container utilities in 2 cases. *Corresponding AuthorEdwin Hendrawan E-mail: hendrawanedwin68@gmail.com © 2018 Penerbit UNSERA. All rights reserved PENDAHULUAN PT. X merupakan sebuah perusahaan yang bergerak dalam bidang jasa yaitu distributor suku cadang sepeda motor X. Kegiatan distribusi dilakukan dengan mengirimkan suku cadang kepada pelanggan yang sudah memesan sesuai dengan jadwal yang telah disepakati. Jumlah pelanggan yang dilayani oleh PT. X di Kota Surabaya dan Kota Sidoarjo sebanyak 128 pelanggan. Pengiriman suku cadang yang dilakukan PT. X menggunakan kendaraan operasional perusahaan yang berjumlah 15 kendaraan.

show abstract

Section: Metode Penelitianunclassified

Optimasi Rute Pengiriman dengan Heterogeneous Fleet Vehicle Routing Problem with Time Windows

Hendrawan

Widyadana

2018

j. sist. manaj. ind.

View full text Add to dashboard Cite

show abstract

“…They propose a MILP, valid inequalities and a heuristic. The same authors give a literature survey on the heterogeneous vehicle routing problem in their recent paper Koç et al (2016b).…”

Section: Deterministic and Stochastic Fleet Sizing Problem Integratedmentioning

confidence: 99%

“…In their survey, Pantuso et al (2014) present a literature review on the maritime fleet size and mix problems. Finally, very recently, Koç et al (2016b) classify and review the literature on heterogeneous VRP.…”

Section: Literature Surveysmentioning

confidence: 99%

Modelling and analysis of a strategic fleet sizing problem for a furniture distributor

Ertoğral

Akbalιk

González

2017

EJIE

View full text Add to dashboard Cite

Abstract:We address a real strategic fleet sizing problem for a furniture and home accessory distributor. The current practice in the real case is to keep the inventory of items in self-owned branch showrooms. The distributor plans to go to a new system where the inventory is centrally held in a distribution centre. In the new system, the area that the distributor serves is split into regions with their assigned group of vehicles. Showrooms in each region only showcase the products, and pass the orders to the distributor and the distributor transports the required items from the central depot to the customers directly. We propose a mixed integer linear program to determine the total number and types of owned and rented vehicles for each region under seasonal demand. We study the effects of different scenarios on cost and demand parameters, and suggest some managerial insights based on a set of numerical analysis.

show abstract

“…In the VRP context, the routing of a heterogeneous fleet of vehicles was recently surveyed in Koç et al (2016). Problems of this class fall into two main variants: (i) the Fleet Size and Mix VRP (FSM-VRP) introduced by Golden et al (1984), which considers an unlimited fleet of various vehicle types and fixed costs for using vehicles.…”

Section: Routing a Heterogeneous Fleet Of Vehiclesmentioning

confidence: 99%