Loading…
A joint production and transportation planning problem with heterogeneous vehicles
We consider a manufacturer's planning problem to schedule order production and transportation to respective destinations. The manufacturer in this setting can use two vehicle types for outbound shipments. The first type is available in unlimited numbers. The availability of the second type, whi...
Saved in:
| Published in: | The Journal of the Operational Research Society 2014-02, Vol.65 (2), p.180-196 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | cdi_FETCH-LOGICAL-c445t-d4c3a735de93e50bfc4ede42ce211c28a33cc7e0809314b34348bfe04783efad3 |
|---|---|
| cites | cdi_FETCH-LOGICAL-c445t-d4c3a735de93e50bfc4ede42ce211c28a33cc7e0809314b34348bfe04783efad3 |
| container_end_page | 196 |
| container_issue | 2 |
| container_start_page | 180 |
| container_title | The Journal of the Operational Research Society |
| container_volume | 65 |
| creator | Toptal, A Koc, U Sabuncuoglu, I |
| description | We consider a manufacturer's planning problem to schedule order production and transportation to respective destinations. The manufacturer in this setting can use two vehicle types for outbound shipments. The first type is available in unlimited numbers. The availability of the second type, which is less expensive, changes over time. Motivated by some industry practices, we present formulations for three different solution approaches: the myopic solution, the hierarchical solution and the coordinated solution. These approaches vary in how the underlying production and transportation subproblems are solved, that is, sequentially versus jointly or heuristically versus optimally. We provide intractability proofs or polynomial-time exact solution procedures for the sub-problems and their special cases. We also compare the three solution approaches over a numerical study to quantify the savings from integration and explicit consideration of transportation availabilities. Our analytical and numerical results set a foundation and a need for a heuristic to solve the integrated problem. We thus propose a tabu search heuristic, which quickly generates near-optimal solutions. |
| doi_str_mv | 10.1057/jors.2012.184 |
| format | article |
| fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_journals_1476246996</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>24502034</jstor_id><sourcerecordid>24502034</sourcerecordid><originalsourceid>FETCH-LOGICAL-c445t-d4c3a735de93e50bfc4ede42ce211c28a33cc7e0809314b34348bfe04783efad3</originalsourceid><addsrcrecordid>eNp1kMtLxDAQh4MouD6OHoWC59bJo6_jsviCBUH0HLLpdLelm9Qk67L_va0V8aCngcw3v5l8hFxRSCik-W1rnU8YUJbQQhyRGRV5Fpc8g2MyA5pBnGYFOyVn3rcAUAItZ-RlHrW2MSHqna12OjTWRMpUUXDK-N66oL6e-k4Z05j1iK063Eb7JmyiDQZ0do0G7c5HH7hpdIf-gpzUqvN4-V3Pydv93eviMV4-Pzwt5stYC5GGuBKaq5ynFZYcU1jVWmCFgmlklGpWKM61zhEKKDkVKy64KFY1gsgLjrWq-Dm5mXKHm9536INs7c6ZYaUcf85EVpbZQMUTpZ313mEte9dslTtICnLUJkdtctQmB20Dn0y8HzizRvcr9Z-B62mg9cG6n3QmUmDAx34x9RtTW7dVe-u6SgZ16KyrB8u68ZL_Hf0JufSO6A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1476246996</pqid></control><display><type>article</type><title>A joint production and transportation planning problem with heterogeneous vehicles</title><source>JSTOR Archival Journals and Primary Sources Collection</source><source>ABI/INFORM Global</source><source>Taylor and Francis Science and Technology Collection</source><creator>Toptal, A ; Koc, U ; Sabuncuoglu, I</creator><creatorcontrib>Toptal, A ; Koc, U ; Sabuncuoglu, I</creatorcontrib><description>We consider a manufacturer's planning problem to schedule order production and transportation to respective destinations. The manufacturer in this setting can use two vehicle types for outbound shipments. The first type is available in unlimited numbers. The availability of the second type, which is less expensive, changes over time. Motivated by some industry practices, we present formulations for three different solution approaches: the myopic solution, the hierarchical solution and the coordinated solution. These approaches vary in how the underlying production and transportation subproblems are solved, that is, sequentially versus jointly or heuristically versus optimally. We provide intractability proofs or polynomial-time exact solution procedures for the sub-problems and their special cases. We also compare the three solution approaches over a numerical study to quantify the savings from integration and explicit consideration of transportation availabilities. Our analytical and numerical results set a foundation and a need for a heuristic to solve the integrated problem. We thus propose a tabu search heuristic, which quickly generates near-optimal solutions.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/jors.2012.184</identifier><identifier>CODEN: OPRQAK</identifier><language>eng</language><publisher>London: Taylor & Francis</publisher><subject>Business and Management ; cargo capacity ; Carrying costs ; Costs ; Customers ; Decision making ; General Paper ; General Papers ; Heuristics ; hierarchical solution ; integrated solution ; Inventory ; Logistics ; Management ; Manufacturers ; Operations research ; Operations Research/Decision Theory ; production and outbound transportation planning ; Production capacity ; Production planning ; Production scheduling ; Shipments ; Studies ; supply chain management ; Tabu search ; Transportation ; Transportation costs ; Transportation planning ; Vehicle capacity ; Vehicles</subject><ispartof>The Journal of the Operational Research Society, 2014-02, Vol.65 (2), p.180-196</ispartof><rights>Copyright © 2013, Operational Research Society 2013</rights><rights>Copyright © 2014 Operational Research Society Ltd</rights><rights>Operational Research Society 2013</rights><rights>Operational Research Society 2014</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c445t-d4c3a735de93e50bfc4ede42ce211c28a33cc7e0809314b34348bfe04783efad3</citedby><cites>FETCH-LOGICAL-c445t-d4c3a735de93e50bfc4ede42ce211c28a33cc7e0809314b34348bfe04783efad3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1476246996/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1476246996?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,27924,27925,36060,44363,58238,58471,74895</link.rule.ids></links><search><creatorcontrib>Toptal, A</creatorcontrib><creatorcontrib>Koc, U</creatorcontrib><creatorcontrib>Sabuncuoglu, I</creatorcontrib><title>A joint production and transportation planning problem with heterogeneous vehicles</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>We consider a manufacturer's planning problem to schedule order production and transportation to respective destinations. The manufacturer in this setting can use two vehicle types for outbound shipments. The first type is available in unlimited numbers. The availability of the second type, which is less expensive, changes over time. Motivated by some industry practices, we present formulations for three different solution approaches: the myopic solution, the hierarchical solution and the coordinated solution. These approaches vary in how the underlying production and transportation subproblems are solved, that is, sequentially versus jointly or heuristically versus optimally. We provide intractability proofs or polynomial-time exact solution procedures for the sub-problems and their special cases. We also compare the three solution approaches over a numerical study to quantify the savings from integration and explicit consideration of transportation availabilities. Our analytical and numerical results set a foundation and a need for a heuristic to solve the integrated problem. We thus propose a tabu search heuristic, which quickly generates near-optimal solutions.</description><subject>Business and Management</subject><subject>cargo capacity</subject><subject>Carrying costs</subject><subject>Costs</subject><subject>Customers</subject><subject>Decision making</subject><subject>General Paper</subject><subject>General Papers</subject><subject>Heuristics</subject><subject>hierarchical solution</subject><subject>integrated solution</subject><subject>Inventory</subject><subject>Logistics</subject><subject>Management</subject><subject>Manufacturers</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>production and outbound transportation planning</subject><subject>Production capacity</subject><subject>Production planning</subject><subject>Production scheduling</subject><subject>Shipments</subject><subject>Studies</subject><subject>supply chain management</subject><subject>Tabu search</subject><subject>Transportation</subject><subject>Transportation costs</subject><subject>Transportation planning</subject><subject>Vehicle capacity</subject><subject>Vehicles</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp1kMtLxDAQh4MouD6OHoWC59bJo6_jsviCBUH0HLLpdLelm9Qk67L_va0V8aCngcw3v5l8hFxRSCik-W1rnU8YUJbQQhyRGRV5Fpc8g2MyA5pBnGYFOyVn3rcAUAItZ-RlHrW2MSHqna12OjTWRMpUUXDK-N66oL6e-k4Z05j1iK063Eb7JmyiDQZ0do0G7c5HH7hpdIf-gpzUqvN4-V3Pydv93eviMV4-Pzwt5stYC5GGuBKaq5ynFZYcU1jVWmCFgmlklGpWKM61zhEKKDkVKy64KFY1gsgLjrWq-Dm5mXKHm9536INs7c6ZYaUcf85EVpbZQMUTpZ313mEte9dslTtICnLUJkdtctQmB20Dn0y8HzizRvcr9Z-B62mg9cG6n3QmUmDAx34x9RtTW7dVe-u6SgZ16KyrB8u68ZL_Hf0JufSO6A</recordid><startdate>20140201</startdate><enddate>20140201</enddate><creator>Toptal, A</creator><creator>Koc, U</creator><creator>Sabuncuoglu, I</creator><general>Taylor & Francis</general><general>Palgrave Macmillan</general><general>Palgrave Macmillan UK</general><general>Taylor & Francis Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>U9A</scope></search><sort><creationdate>20140201</creationdate><title>A joint production and transportation planning problem with heterogeneous vehicles</title><author>Toptal, A ; Koc, U ; Sabuncuoglu, I</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c445t-d4c3a735de93e50bfc4ede42ce211c28a33cc7e0809314b34348bfe04783efad3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Business and Management</topic><topic>cargo capacity</topic><topic>Carrying costs</topic><topic>Costs</topic><topic>Customers</topic><topic>Decision making</topic><topic>General Paper</topic><topic>General Papers</topic><topic>Heuristics</topic><topic>hierarchical solution</topic><topic>integrated solution</topic><topic>Inventory</topic><topic>Logistics</topic><topic>Management</topic><topic>Manufacturers</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>production and outbound transportation planning</topic><topic>Production capacity</topic><topic>Production planning</topic><topic>Production scheduling</topic><topic>Shipments</topic><topic>Studies</topic><topic>supply chain management</topic><topic>Tabu search</topic><topic>Transportation</topic><topic>Transportation costs</topic><topic>Transportation planning</topic><topic>Vehicle capacity</topic><topic>Vehicles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Toptal, A</creatorcontrib><creatorcontrib>Koc, U</creatorcontrib><creatorcontrib>Sabuncuoglu, I</creatorcontrib><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Career & Technical Education Database</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Toptal, A</au><au>Koc, U</au><au>Sabuncuoglu, I</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A joint production and transportation planning problem with heterogeneous vehicles</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>2014-02-01</date><risdate>2014</risdate><volume>65</volume><issue>2</issue><spage>180</spage><epage>196</epage><pages>180-196</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>OPRQAK</coden><abstract>We consider a manufacturer's planning problem to schedule order production and transportation to respective destinations. The manufacturer in this setting can use two vehicle types for outbound shipments. The first type is available in unlimited numbers. The availability of the second type, which is less expensive, changes over time. Motivated by some industry practices, we present formulations for three different solution approaches: the myopic solution, the hierarchical solution and the coordinated solution. These approaches vary in how the underlying production and transportation subproblems are solved, that is, sequentially versus jointly or heuristically versus optimally. We provide intractability proofs or polynomial-time exact solution procedures for the sub-problems and their special cases. We also compare the three solution approaches over a numerical study to quantify the savings from integration and explicit consideration of transportation availabilities. Our analytical and numerical results set a foundation and a need for a heuristic to solve the integrated problem. We thus propose a tabu search heuristic, which quickly generates near-optimal solutions.</abstract><cop>London</cop><pub>Taylor & Francis</pub><doi>10.1057/jors.2012.184</doi><tpages>17</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0160-5682 |
| ispartof | The Journal of the Operational Research Society, 2014-02, Vol.65 (2), p.180-196 |
| issn | 0160-5682 1476-9360 |
| language | eng |
| recordid | cdi_proquest_journals_1476246996 |
| source | JSTOR Archival Journals and Primary Sources Collection; ABI/INFORM Global; Taylor and Francis Science and Technology Collection |
| subjects | Business and Management cargo capacity Carrying costs Costs Customers Decision making General Paper General Papers Heuristics hierarchical solution integrated solution Inventory Logistics Management Manufacturers Operations research Operations Research/Decision Theory production and outbound transportation planning Production capacity Production planning Production scheduling Shipments Studies supply chain management Tabu search Transportation Transportation costs Transportation planning Vehicle capacity Vehicles |
| title | A joint production and transportation planning problem with heterogeneous vehicles |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A55%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20joint%20production%20and%20transportation%20planning%20problem%20with%20heterogeneous%20vehicles&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Toptal,%20A&rft.date=2014-02-01&rft.volume=65&rft.issue=2&rft.spage=180&rft.epage=196&rft.pages=180-196&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=OPRQAK&rft_id=info:doi/10.1057/jors.2012.184&rft_dat=%3Cjstor_proqu%3E24502034%3C/jstor_proqu%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c445t-d4c3a735de93e50bfc4ede42ce211c28a33cc7e0809314b34348bfe04783efad3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1476246996&rft_id=info:pmid/&rft_jstor_id=24502034&rfr_iscdi=true |