A RICH MIN-MAX VEHICLE ROUTING PROBLEM

Volume: 12 Number: 1 April 24, 2016
  • Ertan Yakıcı
TR

A RICH MIN-MAX VEHICLE ROUTING PROBLEM

Abstract

We present a new variant of vehicle routing problem with a min-max objective function. The problem has different types of service demands satisfied by a heterogeneous fleet of vehicles. Unlimited service capacitated vehicles serve the demand points with multiple time windows and requirement of operation synchronization when demand is split between vehicles. A mixed integer linear programming based heuristic solution approach is proposed and a numerical study is carried out to assess the performance of the proposed method.

Keywords

Details

Primary Language

English

Subjects

Engineering

Journal Section

-

Authors

Ertan Yakıcı This is me

Publication Date

April 24, 2016

Submission Date

April 24, 2016

Acceptance Date

March 28, 2016

Published in Issue

Year 2016 Volume: 12 Number: 1

APA
Yakıcı, E. (2016). A RICH MIN-MAX VEHICLE ROUTING PROBLEM. Journal of Naval Sciences and Engineering, 12(1), 19-32. https://izlik.org/JA93NN78RG
AMA
1.Yakıcı E. A RICH MIN-MAX VEHICLE ROUTING PROBLEM. JNSE. 2016;12(1):19-32. https://izlik.org/JA93NN78RG
Chicago
Yakıcı, Ertan. 2016. “A RICH MIN-MAX VEHICLE ROUTING PROBLEM”. Journal of Naval Sciences and Engineering 12 (1): 19-32. https://izlik.org/JA93NN78RG.
EndNote
Yakıcı E (April 1, 2016) A RICH MIN-MAX VEHICLE ROUTING PROBLEM. Journal of Naval Sciences and Engineering 12 1 19–32.
IEEE
[1]E. Yakıcı, “A RICH MIN-MAX VEHICLE ROUTING PROBLEM”, JNSE, vol. 12, no. 1, pp. 19–32, Apr. 2016, [Online]. Available: https://izlik.org/JA93NN78RG
ISNAD
Yakıcı, Ertan. “A RICH MIN-MAX VEHICLE ROUTING PROBLEM”. Journal of Naval Sciences and Engineering 12/1 (April 1, 2016): 19-32. https://izlik.org/JA93NN78RG.
JAMA
1.Yakıcı E. A RICH MIN-MAX VEHICLE ROUTING PROBLEM. JNSE. 2016;12:19–32.
MLA
Yakıcı, Ertan. “A RICH MIN-MAX VEHICLE ROUTING PROBLEM”. Journal of Naval Sciences and Engineering, vol. 12, no. 1, Apr. 2016, pp. 19-32, https://izlik.org/JA93NN78RG.
Vancouver
1.Ertan Yakıcı. A RICH MIN-MAX VEHICLE ROUTING PROBLEM. JNSE [Internet]. 2016 Apr. 1;12(1):19-32. Available from: https://izlik.org/JA93NN78RG