A demand-responsive feeder system (DRFS) presents an alternative to traditional feeder bus systems (TFS) in areas with low demand. This paper introduces an optimization problem to support the planning and operation of a DRFS. A variable neighborhood search (VNS) is employed to optimize the DRFS, focusing on minimizing passengers' travel times. The performance of the VNS is compared with that obtained by solving the mathematical model using a commercial solver (CPLEX) across two networks: a small network for validation and a larger suburban network that simulates a TFS. The results indicate that the VNS is a viable and efficient alternative for optimizing DRFS operations, providing flexibility in route and departure time adjustments, and achieving significant reductions in passenger travel times. The results also demonstrate that the DRFS outperforms the TFS in low-demand areas. On average, the VNS improves upon CPLEX results, obtained within one hour of calculation time for the small network, by 2.3%. Using the same resources, the DRFS reduces the average passenger travel time by 9.6% compared to the TFS.
{"title":"Optimization of a semiflexible demand-responsive feeder bus system using variable neighborhood search","authors":"Fábio Sartori Vieira, Kenneth Sörensen, Pieter Vanstenwegen","doi":"10.1111/itor.13616","DOIUrl":"https://doi.org/10.1111/itor.13616","url":null,"abstract":"<p>A demand-responsive feeder system (DRFS) presents an alternative to traditional feeder bus systems (TFS) in areas with low demand. This paper introduces an optimization problem to support the planning and operation of a DRFS. A variable neighborhood search (VNS) is employed to optimize the DRFS, focusing on minimizing passengers' travel times. The performance of the VNS is compared with that obtained by solving the mathematical model using a commercial solver (CPLEX) across two networks: a small network for validation and a larger suburban network that simulates a TFS. The results indicate that the VNS is a viable and efficient alternative for optimizing DRFS operations, providing flexibility in route and departure time adjustments, and achieving significant reductions in passenger travel times. The results also demonstrate that the DRFS outperforms the TFS in low-demand areas. On average, the VNS improves upon CPLEX results, obtained within one hour of calculation time for the small network, by 2.3%. Using the same resources, the DRFS reduces the average passenger travel time by 9.6% compared to the TFS.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"3413-3440"},"PeriodicalIF":3.1,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144244346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Julio Jiménez-Sarda, Daniel F. Silva, Alice E. Smith
Amidst labor shortages, increasing land prices, and other aspects of the post-pandemic world, our logistics chain must consider new technological alternatives. Automated material handling equipment often requires valuable floor space and specialized layouts. Uncrewed aerial vehicles, popularly called drones, offer a flexible and cost-effective alternative. To explore the potential benefits and challenges of such systems, we used a version of the multi-trip vehicle routing problem with time windows to model two realistic manufacturing environments as use cases. We provide the mixed integer linear programming formulation of this problem and compare results with those of a human-only based system in a detailed simulated environment. Furthermore, as a physical proof-of-concept, we outfitted a commercially available drone with pick-up and carry capabilities. We found that, even with limited drone carrying capacity, there are economic benefits realized from time savings, compared to ground-based material handling systems. Besides these time savings, drones are sustainable as they operate on battery power and do not impair the air quality or the traffic experienced on the ground.
{"title":"Drone-enabled material handling in smart manufacturing","authors":"Julio Jiménez-Sarda, Daniel F. Silva, Alice E. Smith","doi":"10.1111/itor.13621","DOIUrl":"https://doi.org/10.1111/itor.13621","url":null,"abstract":"<p>Amidst labor shortages, increasing land prices, and other aspects of the post-pandemic world, our logistics chain must consider new technological alternatives. Automated material handling equipment often requires valuable floor space and specialized layouts. Uncrewed aerial vehicles, popularly called drones, offer a flexible and cost-effective alternative. To explore the potential benefits and challenges of such systems, we used a version of the multi-trip vehicle routing problem with time windows to model two realistic manufacturing environments as use cases. We provide the mixed integer linear programming formulation of this problem and compare results with those of a human-only based system in a detailed simulated environment. Furthermore, as a physical proof-of-concept, we outfitted a commercially available drone with pick-up and carry capabilities. We found that, even with limited drone carrying capacity, there are economic benefits realized from time savings, compared to ground-based material handling systems. Besides these time savings, drones are sustainable as they operate on battery power and do not impair the air quality or the traffic experienced on the ground.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"3296-3315"},"PeriodicalIF":3.1,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144244458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Policymakers tend to presume that small local education agencies (LEAs) are administratively top heavy, but indivisibilities at the classroom level could just as easily lead small LEAs to overuse teachers rather than administrators. This analysis uses an input distance function and administrative data on students, staff, and spending to estimate the technical and allocative efficiency of Texas public school districts. Our results suggest that small districts are no more likely to overuse administrators than to overuse teachers. Once likely determinants of inefficiency are taken into account, there is no relationship between school district size and the degree of allocative inefficiency. As such, our analysis casts doubt on the efficacy of efficiency rules of thumb that are common in public service practice.
{"title":"Top heavy? On the allocative efficiency of small school districts","authors":"Lori L. Taylor, Shawna Grosskopf, Kathy J. Hayes","doi":"10.1111/itor.13617","DOIUrl":"https://doi.org/10.1111/itor.13617","url":null,"abstract":"<p>Policymakers tend to presume that small local education agencies (LEAs) are administratively top heavy, but indivisibilities at the classroom level could just as easily lead small LEAs to overuse teachers rather than administrators. This analysis uses an input distance function and administrative data on students, staff, and spending to estimate the technical and allocative efficiency of Texas public school districts. Our results suggest that small districts are no more likely to overuse administrators than to overuse teachers. Once likely determinants of inefficiency are taken into account, there is no relationship between school district size and the degree of allocative inefficiency. As such, our analysis casts doubt on the efficacy of efficiency rules of thumb that are common in public service practice.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 5","pages":"2707-2731"},"PeriodicalIF":3.1,"publicationDate":"2025-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143818614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rafael D. Tordecilla, Jairo R. Montoya-Torres, William J. Guerrero
The Physical Internet (PI) is a relatively new logistics paradigm defined as a supply chain framework whose physical components are standardized and optimized with the main objective of increasing the supply chain's overall efficiency, resilience, and sustainability. Given the novelty of the PI concept, there is a lack of scientific literature addressing it from a quantitative point of view, although formulating and solving mathematical models representing resilient PI problems are relevant and innovative issues for academics, practitioners, and governments. In this work, we present a multiperiod mixed-integer programming model to design PI-enabled supply chain networks, in which both cost and resilience are optimized. Hyperconnection and multiple actors are considered in the proposed models. A lexicographic method is proposed to solve these models with multiple objectives, which includes a modified version of the hypervolume measure. Both newly designed and adapted benchmark instances are employed to assess our models' performance. We compare this model against a traditional proprietary logistics model and a horizontal collaboration model between two companies. Results show that hyperconnectivity increases resilience by