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

Simple item page
dc.citation.epage15en_US
dc.citation.issueNumber1en_US
dc.citation.spage2en_US
dc.citation.volumeNumber63en_US
dc.contributor.authorErdoǧan, G.en_US
dc.contributor.authorTansel, B.en_US
dc.contributor.authorAkgün, I.en_US
dc.date.accessioned2016-02-08T09:49:02Z
dc.date.available2016-02-08T09:49:02Z
dc.date.issued2012en_US
dc.departmentDepartment of Industrial Engineeringen_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.description.provenanceMade available in DSpace on 2016-02-08T09:49:02Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2012en
dc.identifier.doi10.1057/jors.2011.8en_US
dc.identifier.eissn1476-9360
dc.identifier.issn0160-5682
dc.identifier.urihttp://hdl.handle.net/11693/21635
dc.language.isoEnglishen_US
dc.publisherPalgrave Macmillanen_US
dc.relation.isversionofhttp://dx.doi.org/10.1057/jors.2011.8en_US
dc.source.titleJournal of the Operational Research Societyen_US
dc.subjectTransporten_US
dc.subjectOptimizationen_US
dc.subjectMilitaryen_US
dc.subjectNetworks and graphsen_US
dc.titleModelling and solving an m-location, n-courier, priority-based planning problem on a networken_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Modelling_and_solving_an_m-location,_n-courier,_priority-based_planning_problem_on_a_network.pdf
Size:
703.75 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering