Pub Date : 2026-01-31DOI: 10.1016/j.ejor.2026.01.051
Daniela Fernandes, Fábio Neves-Moreira, Pedro Amorim, Jan C. Fransoo
{"title":"Optimizing Online Grocery Service: from Customer Understanding to Multichannel Profitability","authors":"Daniela Fernandes, Fábio Neves-Moreira, Pedro Amorim, Jan C. Fransoo","doi":"10.1016/j.ejor.2026.01.051","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.01.051","url":null,"abstract":"","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"4 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146095729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-31DOI: 10.1016/j.ejor.2026.01.050
Heqing Tan, Anthony Chen, Xiangdong Xu
{"title":"Endogenous Route Sets for Spatially Diverse Traffic Assignment","authors":"Heqing Tan, Anthony Chen, Xiangdong Xu","doi":"10.1016/j.ejor.2026.01.050","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.01.050","url":null,"abstract":"","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"83 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146095727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Expansion Strategies of Retail Service Sharing Platform Operations with Service Quality Considerations","authors":"Tania Saha, Sumanta Basu, Balram Avittathur, Tsan-Ming Choi","doi":"10.1016/j.ejor.2026.01.049","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.01.049","url":null,"abstract":"","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"8 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146071962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-28DOI: 10.1016/j.ejor.2026.01.045
Necati Aras, Eda Kemahlıoğlu-Ziya
{"title":"Evaluating the Resilience of a Single-Echelon Supply Chain Using Bilevel Programming: A Case Study for the Infant Formula Industry","authors":"Necati Aras, Eda Kemahlıoğlu-Ziya","doi":"10.1016/j.ejor.2026.01.045","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.01.045","url":null,"abstract":"","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"388 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146071587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-27DOI: 10.1016/j.ejor.2026.01.038
Bin Ji, Qian Wei, Ziyun Wu, Samson S. Yu, Dezhi Zhang, Tom Van Woensel
{"title":"Joint Serial Lock Schedule Design and Sailing Speed Optimization on Inland Waterway for Emission Reduction","authors":"Bin Ji, Qian Wei, Ziyun Wu, Samson S. Yu, Dezhi Zhang, Tom Van Woensel","doi":"10.1016/j.ejor.2026.01.038","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.01.038","url":null,"abstract":"","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"77 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146071968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-25DOI: 10.1016/j.ejor.2026.01.036
Vítor A. Barbosa, Sunil Tiwari, Rafael A. Melo
We introduce the Pickup and Delivery Problem with Time Windows and Scheduling on the Edges (PDPTW-SE), a generalization of the PDPTW that integrates vehicle routing and machine scheduling. The problem involves defining routes for transportation requests with specific pickup and delivery locations using a heterogeneous vehicle fleet, while machines must be scheduled to traverse certain edges. The objective is to minimize the total completion time subject to capacity, time window, and precedence constraints. We propose a mixed-integer linear programming (MIP) formulation, including preprocessing and valid inequalities, and a multi-start heuristic with a linear programming (LP) improvement procedure. A benchmark set with two instance families is also introduced: (i) coordination of pickups and deliveries across islands requiring cargo ships, and (ii) transport across multiple floors, as in hospitals, requiring elevator scheduling. Computational experiments show that the solver on the MIP formulation solves instances with up to 12 requests and finds feasible solutions for 95.0% of the 320 instances with up to 12 requests. For these, the heuristic consistently provides feasible solutions with low deviations, often matching or outperforming the MIP results. For the remaining 160 instances with 40 and 60 requests, only the heuristic finds feasible solutions. We thus recommend the MIP for short-horizon instances (up to 12 requests) and the heuristic for larger or long-horizon instances. Results also highlight the LP improvement procedure’s relevance, reducing solution values by at least 5% on average in general. For larger, tightly constrained instances, an additional machine helps with feasibility and solution quality.
{"title":"The pickup and delivery problem with time windows and scheduling on the edges","authors":"Vítor A. Barbosa, Sunil Tiwari, Rafael A. Melo","doi":"10.1016/j.ejor.2026.01.036","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.01.036","url":null,"abstract":"We introduce the Pickup and Delivery Problem with Time Windows and Scheduling on the Edges (PDPTW-SE), a generalization of the PDPTW that integrates vehicle routing and machine scheduling. The problem involves defining routes for transportation requests with specific pickup and delivery locations using a heterogeneous vehicle fleet, while machines must be scheduled to traverse certain edges. The objective is to minimize the total completion time subject to capacity, time window, and precedence constraints. We propose a mixed-integer linear programming (MIP) formulation, including preprocessing and valid inequalities, and a multi-start heuristic with a linear programming (LP) improvement procedure. A benchmark set with two instance families is also introduced: (i) coordination of pickups and deliveries across islands requiring cargo ships, and (ii) transport across multiple floors, as in hospitals, requiring elevator scheduling. Computational experiments show that the solver on the MIP formulation solves instances with up to 12 requests and finds feasible solutions for 95.0% of the 320 instances with up to 12 requests. For these, the heuristic consistently provides feasible solutions with low deviations, often matching or outperforming the MIP results. For the remaining 160 instances with 40 and 60 requests, only the heuristic finds feasible solutions. We thus recommend the MIP for short-horizon instances (up to 12 requests) and the heuristic for larger or long-horizon instances. Results also highlight the LP improvement procedure’s relevance, reducing solution values by at least 5% on average in general. For larger, tightly constrained instances, an additional machine helps with feasibility and solution quality.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"291 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146047865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：