An improved variable neighborhood search for the open vehicle routing problem with time windows

A. A.N.Perwira Redi; Meilinda F.N. Maghfiroh; Vincent F. Yu

doi:10.1109/IEEM.2013.6962688

An improved variable neighborhood search for the open vehicle routing problem with time windows

A. A.N.Perwira Redi, Meilinda F.N. Maghfiroh, Vincent F. Yu

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other

7 Citations (Scopus)

Abstract

This paper considers the open vehicle routing problem with time windows (OVRPTW). An improved variable neighborhood search (VNS) algorithm is proposed to solve the problem. The improved VNS features a route construction mechanism to ensure the customers with earlier time windows will be served first. The results of computational study indicate that the proposed algorithm can solve OVRPTW effectively.

Original language	English
Title of host publication	IEEE International Conference on Industrial Engineering and Engineering Management
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	1641-1645
Number of pages	5
ISBN (Electronic)	9781479909865
DOIs	https://doi.org/10.1109/IEEM.2013.6962688
Publication status	Published - 18 Nov 2014
Externally published	Yes
Event	IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) 2013 - Bangkok, Thailand Duration: 10 Dec 2013 → 13 Dec 2013 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6945926

Conference

Conference	IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) 2013
Abbreviated title	IEEM 2013
Country/Territory	Thailand
City	Bangkok
Period	10/12/13 → 13/12/13
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6945926

Keywords

open vehicle routing problem
time windows
variable neighborhood search

Access to Document

10.1109/IEEM.2013.6962688

Cite this

Redi, A. A. N. P., Maghfiroh, M. F. N., & Yu, V. F. (2014). An improved variable neighborhood search for the open vehicle routing problem with time windows. In IEEE International Conference on Industrial Engineering and Engineering Management (pp. 1641-1645). Article 6962688 IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/IEEM.2013.6962688

@inproceedings{94b422b98e594bf9b2d6522f40f30095,

title = "An improved variable neighborhood search for the open vehicle routing problem with time windows",

abstract = "This paper considers the open vehicle routing problem with time windows (OVRPTW). An improved variable neighborhood search (VNS) algorithm is proposed to solve the problem. The improved VNS features a route construction mechanism to ensure the customers with earlier time windows will be served first. The results of computational study indicate that the proposed algorithm can solve OVRPTW effectively.",

keywords = "open vehicle routing problem, time windows, variable neighborhood search",

author = "Redi, {A. A.N.Perwira} and Maghfiroh, {Meilinda F.N.} and Yu, {Vincent F.}",

year = "2014",

month = nov,

day = "18",

doi = "10.1109/IEEM.2013.6962688",

language = "English",

pages = "1641--1645",

booktitle = "IEEE International Conference on Industrial Engineering and Engineering Management",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States of America",

note = "IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) 2013, IEEM 2013 ; Conference date: 10-12-2013 Through 13-12-2013",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6945926",

}

Redi, AANP, Maghfiroh, MFN & Yu, VF 2014, An improved variable neighborhood search for the open vehicle routing problem with time windows. in IEEE International Conference on Industrial Engineering and Engineering Management., 6962688, IEEE, Institute of Electrical and Electronics Engineers, pp. 1641-1645, IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) 2013, Bangkok, Thailand, 10/12/13. https://doi.org/10.1109/IEEM.2013.6962688

An improved variable neighborhood search for the open vehicle routing problem with time windows. / Redi, A. A.N.Perwira; Maghfiroh, Meilinda F.N.; Yu, Vincent F.
IEEE International Conference on Industrial Engineering and Engineering Management. IEEE, Institute of Electrical and Electronics Engineers, 2014. p. 1641-1645 6962688.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other

TY - GEN

T1 - An improved variable neighborhood search for the open vehicle routing problem with time windows

AU - Redi, A. A.N.Perwira

AU - Maghfiroh, Meilinda F.N.

AU - Yu, Vincent F.

PY - 2014/11/18

Y1 - 2014/11/18

N2 - This paper considers the open vehicle routing problem with time windows (OVRPTW). An improved variable neighborhood search (VNS) algorithm is proposed to solve the problem. The improved VNS features a route construction mechanism to ensure the customers with earlier time windows will be served first. The results of computational study indicate that the proposed algorithm can solve OVRPTW effectively.

AB - This paper considers the open vehicle routing problem with time windows (OVRPTW). An improved variable neighborhood search (VNS) algorithm is proposed to solve the problem. The improved VNS features a route construction mechanism to ensure the customers with earlier time windows will be served first. The results of computational study indicate that the proposed algorithm can solve OVRPTW effectively.

KW - open vehicle routing problem

KW - time windows

KW - variable neighborhood search

UR - http://www.scopus.com/inward/record.url?scp=84914129297&partnerID=8YFLogxK

U2 - 10.1109/IEEM.2013.6962688

DO - 10.1109/IEEM.2013.6962688

M3 - Conference Paper

SP - 1641

EP - 1645

BT - IEEE International Conference on Industrial Engineering and Engineering Management

PB - IEEE, Institute of Electrical and Electronics Engineers

T2 - IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) 2013

Y2 - 10 December 2013 through 13 December 2013

ER -

An improved variable neighborhood search for the open vehicle routing problem with time windows

Abstract

Conference

Keywords

Access to Document

Other files and links

Cite this