Simultaneous Production and Transportation Problem: A Case of Additive Manufacturing

IF 4.4 2区 工程技术 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Gourav Dwivedi, S. Chakraborty, Y. Agarwal, R. Srivastava
{"title":"Simultaneous Production and Transportation Problem: A Case of Additive Manufacturing","authors":"Gourav Dwivedi, S. Chakraborty, Y. Agarwal, R. Srivastava","doi":"10.1287/trsc.2022.1195","DOIUrl":null,"url":null,"abstract":"Additive manufacturing (AM) promises considerable advantages over conventional manufacturing to meet the growing demand for customized products and faster delivery times. Consider a mobile mini-factory, that is, a vehicle equipped with an AM facility, which can simultaneously produce and transport the final products to the customers. The overlapping of production and transportation processes allows potential savings on customer delivery lead times and inventory holding costs, thereby facilitating on-demand fulfillment of the orders of intricate products. Based on this situation and motivated by a recent Amazon patent, we introduce a novel routing optimization problem called Simultaneous Production and Transportation Problem (SPTP) in this study. Given a set of customers and their respective orders with associated production time and delivery due dates, SPTP minimizes the trip time for the AM installed vehicle while meeting the customers’ stipulated due dates for all deliveries. We formulate the problem using a mixed integer linear program, discuss several valid inequalities to strengthen the formulation, and discuss a cutting-plane-based exact solution approach. We also design a variable neighborhood search metaheuristic to solve larger instances of SPTP very efficiently. The effectiveness of the exact and heuristic solution approaches is demonstrated using extensive computational experiments. The study also explores the interaction between production and travel times in SPTP and how the problem compares with the traveling salesman problem and the single machine scheduling problem, each of which may be viewed as special cases of SPTP. Further, the problem involves a trade-off between the total trip time and the tardiness of the deliveries. Therefore, an extension of the proposed formulation is also proposed with interesting managerial insights on identifying appropriate trip time-tardiness combinations using an illustrative example. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2022.1195 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":" ","pages":""},"PeriodicalIF":4.4000,"publicationDate":"2023-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Science","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1287/trsc.2022.1195","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 1

Abstract

Additive manufacturing (AM) promises considerable advantages over conventional manufacturing to meet the growing demand for customized products and faster delivery times. Consider a mobile mini-factory, that is, a vehicle equipped with an AM facility, which can simultaneously produce and transport the final products to the customers. The overlapping of production and transportation processes allows potential savings on customer delivery lead times and inventory holding costs, thereby facilitating on-demand fulfillment of the orders of intricate products. Based on this situation and motivated by a recent Amazon patent, we introduce a novel routing optimization problem called Simultaneous Production and Transportation Problem (SPTP) in this study. Given a set of customers and their respective orders with associated production time and delivery due dates, SPTP minimizes the trip time for the AM installed vehicle while meeting the customers’ stipulated due dates for all deliveries. We formulate the problem using a mixed integer linear program, discuss several valid inequalities to strengthen the formulation, and discuss a cutting-plane-based exact solution approach. We also design a variable neighborhood search metaheuristic to solve larger instances of SPTP very efficiently. The effectiveness of the exact and heuristic solution approaches is demonstrated using extensive computational experiments. The study also explores the interaction between production and travel times in SPTP and how the problem compares with the traveling salesman problem and the single machine scheduling problem, each of which may be viewed as special cases of SPTP. Further, the problem involves a trade-off between the total trip time and the tardiness of the deliveries. Therefore, an extension of the proposed formulation is also proposed with interesting managerial insights on identifying appropriate trip time-tardiness combinations using an illustrative example. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2022.1195 .
同时生产和运输问题:以增材制造为例
增材制造(AM)有望比传统制造具有相当大的优势,以满足日益增长的定制产品需求和更快的交付时间。考虑一个移动迷你工厂,即配备AM设施的车辆,它可以同时生产并将最终产品运输给客户。生产和运输流程的重叠可以节省客户交付周期和库存成本,从而促进复杂产品订单的按需履行。基于这种情况,并受最近亚马逊专利的启发,我们在本研究中引入了一个新的路由优化问题,称为同时生产和运输问题(SPTP)。给定一组客户及其各自的订单以及相关的生产时间和交付到期日,SPTP在满足客户规定的所有交付到期日的同时,最大限度地缩短AM安装车辆的行程时间。我们使用混合整数线性规划来公式化这个问题,讨论了几个有效的不等式来加强公式化,并讨论了一种基于切割平面的精确求解方法。我们还设计了一个可变邻域搜索元启发式算法来非常有效地解决较大的SPTP实例。通过大量的计算实验证明了精确求解和启发式求解方法的有效性。该研究还探讨了SPTP中生产时间和行程时间之间的相互作用,以及该问题与旅行推销员问题和单机调度问题的比较,每一个问题都可以被视为SPTP的特殊情况。此外,这个问题涉及总行程时间和交货延迟之间的权衡。因此,还提出了对所提出公式的扩展,并通过一个示例对识别适当的行程-时间-延误组合进行了有趣的管理见解。补充材料:在线附录可在https://doi.org/10.1287/trsc.2022.1195。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Transportation Science
Transportation Science 工程技术-运筹学与管理科学
CiteScore
8.30
自引率
10.90%
发文量
111
审稿时长
12 months
期刊介绍: Transportation Science, published quarterly by INFORMS, is the flagship journal of the Transportation Science and Logistics Society of INFORMS. As the foremost scientific journal in the cross-disciplinary operational research field of transportation analysis, Transportation Science publishes high-quality original contributions and surveys on phenomena associated with all modes of transportation, present and prospective, including mainly all levels of planning, design, economic, operational, and social aspects. Transportation Science focuses primarily on fundamental theories, coupled with observational and experimental studies of transportation and logistics phenomena and processes, mathematical models, advanced methodologies and novel applications in transportation and logistics systems analysis, planning and design. The journal covers a broad range of topics that include vehicular and human traffic flow theories, models and their application to traffic operations and management, strategic, tactical, and operational planning of transportation and logistics systems; performance analysis methods and system design and optimization; theories and analysis methods for network and spatial activity interaction, equilibrium and dynamics; economics of transportation system supply and evaluation; methodologies for analysis of transportation user behavior and the demand for transportation and logistics services. Transportation Science is international in scope, with editors from nations around the globe. The editorial board reflects the diverse interdisciplinary interests of the transportation science and logistics community, with members that hold primary affiliations in engineering (civil, industrial, and aeronautical), physics, economics, applied mathematics, and business.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信