Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A computation-implementation parallelization approach to the vehicle loading and routing problem
Date
2019-01-01
Author
Çavdar, Bahar
Sokol, Joel
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
229
views
0
downloads
Cite This
In this article, we address a version of the capacitated vehicle routing problem where there is a constraint on the total time that can be spent on computing delivery routes and loading the vehicles. This problem, which we call the vehicle loading and routing problem (VLRP), can arise, for example, in the delivery of small, quick-turnaround orders from a warehouse. We propose a computation-implementation parallelization (CIP) approach to solving large VLRP instances, and present computational results showing that CIP improves upon the conventional compute-first-implement-later method. Our approach allows us to find lower-cost solutions in the same amount of time, or alternatively to find equally good solutions that allow improvements in order cutoff time or truck dispatching time to increase customer satisfaction.
Subject Keywords
Computer Networks and Communications
,
Hardware and Architecture
,
Software
,
Information Systems
URI
https://hdl.handle.net/11511/56693
Journal
NETWORKS
DOI
https://doi.org/10.1002/net.21848
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
A Cognitive Routing Protocol for Bio-Inspired Networking in the Internet of Nano-Things (IoNT)
Al-Turjman, Fadi (Springer Science and Business Media LLC, 2020-10-01)
In this paper, we propose a framework for data delivery in nano-scale networks, where numerous wireless sensors are distributed on a human body, small object, tiny plant root, etc. Our framework caters for green energy-efficient applications in the Internet of Nano Things (IoNT) where data is relayed via nano-routers from a multifarious nanonodes towards a gateway connected to a large-scale network such as the Internet. We consider the entire network energy while choosing the next hop for our routed packets...
A new scalable service discipline for real-time traffic: The framed-deadline scheduler
Schmidt, Şenan Ece (Elsevier BV, 2007-03-26)
Qulaity of Service (Qos) support in a scalable and low-complexity fashion is important in high-speed networks carrying real-time traffic. There are service disciplines that can provide end-to-end bandwidth and delay guarantees. However, they are designed to operate with expensive output quenching switches or with combined input-output queuing (CIOQ) switches that require very complicated fabric work with a CIOQ packet switch to provide the same end-to-end QoS guarantees as service disciplines that only work...
A self-organizing neural network approach for the single AGV routing problem
Soylu, M; Özdemirel, Nur Evin; Kayaligil, S (2000-02-15)
In this research, a special form of Automated Guided Vehicle (AGV) routing problem is investigated. The objective is to find the shortest tour for a single, free-ranging AGV that has to carry out multiple pick and deliver (P&D) requests. This problem is an incidence of the asymmetric traveling salesman problem which is known to be NP-complete. An artificial neural network algorithm based on Kohonen's self-organizing feature maps is developed to solve the problem, and several improvements on the basic featur...
Robust Priority Assignments for Extending Existing Controller Area Network Applications
Schmidt, Klaus Verner (Institute of Electrical and Electronics Engineers (IEEE), 2014-02-01)
The usage of the controller area network (CAN) as an in-vehicle communication bus requires finding feasible and robust priority orders such that each message transmitted on the bus meets its specified deadline and tolerates potential transmission errors. Although such priority orders can be determined by available algorithms whenever they exist, it is always assumed that a CAN priority order is computed from scratch. In practical applications, it is frequently necessary to extend an existing message set by ...
Modelling Green Femtocells in Smart-grids
Al-Turjman, Fadi M. (Springer Science and Business Media LLC, 2018-08-01)
On going demands to connect massive amounts of the heterogeneous mobile devices and data traffics make the mobile operators in desperate need to find energy-efficient solutions for coverage and real-time services. Accordingly, mobile femtocells are found to be a promising solution in the coming few decades. This paper presents energy-based analysis for mobile femtocells in Ultra-Large Scale (ULS) applications such as the smart-grid. The potential reduction of the consumed energy and service interruption due...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. Çavdar and J. Sokol, “A computation-implementation parallelization approach to the vehicle loading and routing problem,”
NETWORKS
, pp. 119–134, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56693.