{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T16:31:38Z","timestamp":1768321898924,"version":"3.49.0"},"reference-count":44,"publisher":"Emerald","issue":"8","license":[{"start":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:00:00Z","timestamp":1601251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K"],"published-print":{"date-parts":[[2021,7,22]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The traveling purchaser problem (TPP) has gained attention in academics to deal with different variants in real business world. This study aims to study a green TPP with quantity discounts and soft time windows (TPPQS), in which a firm needs to purchase products from a set of available markets and deliver the products to a set of customers.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>Vehicles are available to visit the markets, which offer products at different prices and with different quantity discount schemes. Soft time windows are present for the markets and the customers, and earliness cost and tardiness may incur if a vehicle cannot arrive a market or a customer within the designated time interval. The environmental impact of transportation activities is considered. The objective of this research is to minimize the total cost, including vehicle-assigning cost, vehicle-traveling cost, purchasing cost, emission cost, earliness cost and tardiness cost, while meeting the total demand of the customers and satisfying all the constraints. A mixed integer programming (MIP) model and a genetic algorithm (GA) approach are proposed to solve the TPPQS.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The results show that both the MIP and the GA can obtain optimal solutions for small-scale cases, and the GA can generate near-optimal solutions for large-scale cases within a short computational time.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title>\n<jats:p>The proposed models can help firms increase the performance of customer satisfaction and provide valuable supply chain management references in the service industry.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>The proposed models for TPPQS are novel and can facilitate firms to design their green traveling purchasing plans more effectively in today\u2019s environmental conscious and competitive market.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/k-04-2020-0237","type":"journal-article","created":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T11:58:13Z","timestamp":1600948693000},"page":"2289-2317","source":"Crossref","is-referenced-by-count":11,"title":["An optimization approach for traveling purchaser problem with environmental impact of transportation cost"],"prefix":"10.1108","volume":"50","author":[{"given":"He-Yau","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amy H.I.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Fan","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2020,9,28]]},"reference":[{"issue":"1","key":"key2021072110283210200_ref001","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10479-011-0994-0","article-title":"An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem","volume":"199","year":"2012","journal-title":"Annals of Operations Research"},{"key":"key2021072110283210200_ref002","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.cor.2017.01.001","article-title":"The traveling purchaser problem with time-dependent quantities","volume":"82","year":"2017","journal-title":"Computers and Operations Research"},{"issue":"1","key":"key2021072110283210200_ref003","first-page":"41","article-title":"A stochastic programming approach for the traveling purchaser problem","volume":"28","year":"2015","journal-title":"IMA Journal of Management Mathematics"},{"issue":"4","key":"key2021072110283210200_ref004","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1111\/itor.12330","article-title":"Metaheuristics based on decision hierarchies for the traveling purchaser problem","volume":"25","year":"2018","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"key2021072110283210200_ref005","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2013.10.018","article-title":"The distance constrained multiple vehicle traveling purchaser problem","volume":"235","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"key2021072110283210200_ref006","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.cor.2006.03.023","article-title":"Ant colony optimization for the traveling purchaser problem","volume":"35","year":"2008","journal-title":"Computers and Operations Research"},{"issue":"3","key":"key2021072110283210200_ref007","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1057\/jors.1966.56","article-title":"A heuristic method for a job-scheduling problem","volume":"17","year":"1966","journal-title":"Journal of the Operational Research Society"},{"key":"key2021072110283210200_ref008","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.jclepro.2018.06.246","article-title":"An inventory model of supply chain disruption recovery with safety stock and carbon emission consideration","volume":"197","year":"2018","journal-title":"Journal of Cleaner Production"},{"issue":"1","key":"key2021072110283210200_ref009","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1080\/00207543.2012.674649","article-title":"A stochastic lot-sizing model with multi-supplier and quantity discount","volume":"51","year":"2013","journal-title":"International Journal of Production Research"},{"issue":"4","key":"key2021072110283210200_ref010","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1080\/00207543.2016.1218564","article-title":"An efficient method for dynamic-demand joint replenishment problem with multiple suppliers and multiple vehicles","volume":"55","year":"2017","journal-title":"International Journal of Production Research"},{"issue":"4","key":"key2021072110283210200_ref011","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1007\/s00500-015-1595-7","article-title":"An enhanced model for the integrated production and transportation problem in a multiple vehicles environment","volume":"20","year":"2016","journal-title":"Soft Computing"},{"key":"key2021072110283210200_ref012","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.resconrec.2012.03.005","article-title":"A carbon footprint based reverse logistics network design model","volume":"67","year":"2012","journal-title":"Resources, Conservation and Recycling"},{"issue":"2","key":"key2021072110283210200_ref013","doi-asserted-by":"crossref","first-page":"1858","DOI":"10.1016\/j.asoc.2010.05.035","article-title":"An evolutionary-based approach for solving a capacitated hub location problem","volume":"11","year":"2011","journal-title":"Applied Soft Computing"},{"issue":"6","key":"key2021072110283210200_ref014","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1287\/opre.51.6.940.24921","article-title":"A branch-and-cut algorithm for the undirected traveling purchaser problem","volume":"51","year":"2003","journal-title":"Operations Research"},{"issue":"4","key":"key2021072110283210200_ref015","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1080\/00207721.2011.618644","article-title":"Solving lot-sizing problem with quantity discount and transportation cost","volume":"44","year":"2013","journal-title":"International Journal of Systems Science"},{"issue":"7","key":"key2021072110283210200_ref016","doi-asserted-by":"crossref","first-page":"4733","DOI":"10.1016\/j.apm.2012.09.056","article-title":"An integrated model for lot sizing with supplier selection and quantity discounts","volume":"37","year":"2013","journal-title":"Applied Mathematical Modelling"},{"issue":"11","key":"key2021072110283210200_ref017","doi-asserted-by":"crossref","first-page":"3887","DOI":"10.3390\/su10113887","article-title":"An integrated approach for sustainable supply chain management with replenishment, transportation, and production decisions","volume":"10","year":"2018","journal-title":"Sustainability"},{"issue":"1","key":"key2021072110283210200_ref018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2016.12.017","article-title":"The traveling purchaser problem and its variants","volume":"259","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"key2021072110283210200_ref019","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.asoc.2018.05.026","article-title":"Algorithms for the multi-objective vehicle routing problem with hard time windows and stochastic travel time and service time","volume":"70","year":"2018","journal-title":"Applied Soft Computing"},{"issue":"2","key":"key2021072110283210200_ref020","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/trsc.2014.0558","article-title":"A multistage very large-scale neighborhood search for the vehicle routing problem with soft time windows","volume":"49","year":"2015","journal-title":"Transportation Science"},{"key":"key2021072110283210200_ref021","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.tre.2016.04.006","article-title":"Fair profit contract for a carrier collaboration framework in a green hub network under soft time-windows: dual lexicographic max\u2013min approach","volume":"91","year":"2016","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"key2021072110283210200_ref022","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.cor.2016.06.003","article-title":"Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution","volume":"76","year":"2016","journal-title":"Computers and Operations Research"},{"issue":"1","key":"key2021072110283210200_ref023","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","article-title":"Multi-objective genetic algorithms for vehicle routing problem with time windows","volume":"24","year":"2006","journal-title":"Applied Intelligence"},{"issue":"2","key":"key2021072110283210200_ref024","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.ejor.2018.08.039","article-title":"The bi-objective traveling purchaser problem with deliveries","volume":"273","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"key2021072110283210200_ref025","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ijpe.2010.10.023","article-title":"The reduction of greenhouse gas emissions from freight transport by pooling supply chains","volume":"143","year":"2013","journal-title":"International Journal of Production Economics"},{"key":"key2021072110283210200_ref026","first-page":"229","article-title":"A sustainable transportation-location-routing problem with soft time windows for distribution systems","volume":"6","year":"2018","journal-title":"Uncertain Supply Chain Management"},{"issue":"2","key":"key2021072110283210200_ref027","first-page":"78","article-title":"Traveling purchaser problem","volume":"18","year":"1981","journal-title":"Opsearch"},{"issue":"2","key":"key2021072110283210200_ref028","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.cor.2011.04.015","article-title":"Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach","volume":"39","year":"2012","journal-title":"Computers and Operations Research"},{"issue":"4","key":"key2021072110283210200_ref029","first-page":"790","article-title":"Optimization approaches to a routing and scheduling problem of oil tankers","volume":"24","year":"2017","journal-title":"Gest\u00e3o and Produ\u00e7\u00e3o"},{"key":"key2021072110283210200_ref030","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.cie.2017.09.020","article-title":"Green transportation scheduling with speed control: trade-off between total transportation cost and carbon emission","volume":"113","year":"2017","journal-title":"Computers and Industrial Engineering"},{"issue":"12","key":"key2021072110283210200_ref031","doi-asserted-by":"crossref","first-page":"1244","DOI":"10.3390\/su8121244","article-title":"A Stackelberg game approach in an integrated inventory model with carbon-emission and setup cost reduction","volume":"8","year":"2016","journal-title":"Sustainability"},{"key":"key2021072110283210200_ref032","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.tre.2016.03.018","article-title":"Effect of variable transportation and carbon emission in a three-echelon supply chain model","volume":"91","year":"2016","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"2","key":"key2021072110283210200_ref033","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/17509653.2015.1136247","article-title":"Pickup and delivery supply chain network with semi soft time windows: metaheuristic approach","volume":"12","year":"2017","journal-title":"International Journal of Management Science and Engineering Management"},{"issue":"3","key":"key2021072110283210200_ref034","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(96)00313-X","article-title":"A branch and bound algorithm for the traveling purchaser problem","volume":"97","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"key2021072110283210200_ref035","doi-asserted-by":"crossref","first-page":"1664","DOI":"10.1016\/j.jclepro.2017.11.040","article-title":"On the mathematical modeling of green one-to-one pickup and delivery problem with road segmentation","volume":"174","year":"2018","journal-title":"Journal of Cleaner Production"},{"issue":"2","key":"key2021072110283210200_ref036","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","year":"1997","journal-title":"Transportation Science"},{"key":"key2021072110283210200_ref037","doi-asserted-by":"crossref","first-page":"15447","DOI":"10.1007\/s10586-018-2635-8","article-title":"A tabu search algorithm for distribution network optimization with discrete split deliveries and soft time windows","volume":"22","year":"2019","journal-title":"Cluster Computing"},{"key":"key2021072110283210200_ref038","doi-asserted-by":"crossref","first-page":"8725","DOI":"10.1007\/s10586-018-1957-x","article-title":"Improved tabu search algorithm for the open vehicle routing problem with soft time windows and satisfaction rate","volume":"22","year":"2019","journal-title":"Cluster Computing"},{"issue":"11","key":"key2021072110283210200_ref039","doi-asserted-by":"crossref","first-page":"4257","DOI":"10.3390\/su10114257","article-title":"A bi-objective vehicle-routing problem with soft time windows and multiple depots to minimize the total energy consumption and customer dissatisfaction","volume":"10","year":"2018","journal-title":"Sustainability"},{"key":"key2021072110283210200_ref040","first-page":"5743287","article-title":"Cost-optimization problem with a soft time window based on an improved fuzzy genetic algorithm for fresh food distribution","volume":"2018","year":"2018","journal-title":"Mathematical Problems in Engineering"},{"issue":"6","key":"key2021072110283210200_ref041","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1108\/JMTM-06-2017-0118","article-title":"Bi-objective optimization for sustainable supply chain network design in omnichannel","volume":"30","year":"2019","journal-title":"Journal of Manufacturing Technology Management"},{"issue":"4","key":"key2021072110283210200_ref042","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.3390\/su10041002","article-title":"The optimal decisions for a sustainable supply chain with carbon information asymmetry under cap-and-trad","volume":"10","year":"2018","journal-title":"Sustainability"},{"key":"key2021072110283210200_ref043","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.cie.2015.09.002","article-title":"Site dependent vehicle routing problem with soft time window: modeling and solution approach","volume":"90","year":"2015","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"key2021072110283210200_ref044","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.cie.2009.06.012","article-title":"A novel genetic algorithm for solving production and transportation scheduling in a two-stage supply chain","volume":"58","year":"2010","journal-title":"Computers and Industrial Engineering"}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-04-2020-0237\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-04-2020-0237\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:47:50Z","timestamp":1753393670000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/50\/8\/2289-2317\/260250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,28]]},"references-count":44,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2020,9,28]]},"published-print":{"date-parts":[[2021,7,22]]}},"alternative-id":["10.1108\/K-04-2020-0237"],"URL":"https:\/\/doi.org\/10.1108\/k-04-2020-0237","relation":{},"ISSN":["0368-492X","0368-492X"],"issn-type":[{"value":"0368-492X","type":"print"},{"value":"0368-492X","type":"print"}],"subject":[],"published":{"date-parts":[[2020,9,28]]}}}