Modelling and solving an m-location, n-courier, priority-based planning problem on a network

Name: Modelling and solving an m-location, n-courier, priority-based planning problem on a network
Author: Erdoğan, Güneş, Tansel, B., Akgün, İ.

İsim	Modelling and solving an m-location, n-courier, priority-based planning problem on a network
Yazar	Erdoğan, Güneş, Tansel, B., Akgün, İ.
Basım Tarihi:	2012-01
Basım Yeri	- Springer Nature
Konu	Optimization, Military, Transport
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0160-5682
Kayıt Numarası	679c3acc-00df-4af8-9a13-a3a13cb209a5
Lokasyon	Industrial Engineering
Tarih	2012-01
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	In this paper, we study an m-location, n-courier, priority-based planning problem on a network, which we refer to as the Courier Planning Problem (CPP). The CPP arises on a daily basis in the context of planning the transportation of materials and personnel in peacetime for the Turkish Armed Forces. The main issue addressed in CPP is to transport as many of deliverables as possible from their origins to their destinations via a ﬂeet of transportation assets (couriers) that operate at ﬁxed routes and schedules. Priorities must be taken into account and constraints on the routes, operating schedules, and capacities of the transportation assets must be obeyed. Time windows may be speciﬁed for some or all transportation requests and must be satisﬁed. We study the CPP as well as its two extensions, and present integer programming formulations based on the multi-commodity ﬂow structure. The formulations are tested on real world-based data and display satisfactory computational performance. Our main contributions are to develop an effective formulation scheme for a complicated large-scale real world problem and to demonstrate that such problems are solvable via commercial general purpose solvers through meticulous modelling.
DOI	10.1057/jors.2011.8
Cilt	63

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Modelling and solving an m-location, n-courier, priority-based planning problem on a network

Yazar Erdoğan, Güneş, Tansel, B., Akgün, İ.

Basım Tarihi 2012-01

Basım Yeri - Springer Nature

Konu Optimization, Military, Transport

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0160-5682

Kayıt Numarası 679c3acc-00df-4af8-9a13-a3a13cb209a5

Lokasyon Industrial Engineering

Tarih 2012-01

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin In this paper, we study an m-location, n-courier, priority-based planning problem on a network, which we refer to as the Courier Planning Problem (CPP). The CPP arises on a daily basis in the context of planning the transportation of materials and personnel in peacetime for the Turkish Armed Forces. The main issue addressed in CPP is to transport as many of deliverables as possible from their origins to their destinations via a ﬂeet of transportation assets (couriers) that operate at ﬁxed routes and schedules. Priorities must be taken into account and constraints on the routes, operating schedules, and capacities of the transportation assets must be obeyed. Time windows may be speciﬁed for some or all transportation requests and must be satisﬁed. We study the CPP as well as its two extensions, and present integer programming formulations based on the multi-commodity ﬂow structure. The formulations are tested on real world-based data and display satisfactory computational performance. Our main contributions are to develop an effective formulation scheme for a complicated large-scale real world problem and to demonstrate that such problems are solvable via commercial general purpose solvers through meticulous modelling.

DOI 10.1057/jors.2011.8

Cilt 63