Show simple item record

dc.contributor.authorErdoğan, Güneş
dc.contributor.authorTansel, B.
dc.contributor.authorAkgün, İ.
dc.date.accessioned2013-11-26T07:44:27Z
dc.date.available2013-11-26T07:44:27Z
dc.date.issued2012-01
dc.identifier.issn0160-5682
dc.identifier.urihttp://hdl.handle.net/10679/300
dc.identifier.urihttp://www.palgrave-journals.com/jors/journal/v63/n1/full/jors20118a.html
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.en_US
dc.description.abstractIn 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 fleet of transportation assets (couriers) that operate at fixed 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 specified for some or all transportation requests and must be satisfied. We study the CPP as well as its two extensions, and present integer programming formulations based on the multi-commodity flow 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.en_US
dc.language.isoengen_US
dc.publisherSpringer Natureen_US
dc.relation.ispartofJournal of the Operational Research Society
dc.rightsrestrictedAccess
dc.titleModelling and solving an m-location, n-courier, priority-based planning problem on a networken_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID(ORCID 0000-0002-2456-3719 & YÖK ID 172715) Erdoğan, Güneş
dc.contributor.ozuauthorErdoğan, Güneş
dc.identifier.volume63
dc.identifier.issue1
dc.identifier.startpage2
dc.identifier.endpage15
dc.identifier.wosWOS:000298238700002
dc.identifier.doi10.1057/jors.2011.8
dc.subject.keywordsOptimizationen_US
dc.subject.keywordsMilitaryen_US
dc.subject.keywordsTransporten_US
dc.identifier.scopusSCOPUS:2-s2.0-82955187008
dc.contributor.authorMale1
dc.relation.publicationcategoryArticle - International Refereed Journal - Institutional Academic Staff


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record


Share this page