Hector J. Carlo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hector J. Carlo has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Andrew L. Johnson
Texas A&M University
4 shared publications - Dima Nazzal
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology
4 shared publications Iris F.A. Vis
4 shared publicationsJesus A. Jimenez
Ingram School of Engineering , Texas State University-San Marcos , San Marcos, TX 78666, USA
4 shared publications- Kees Jan Roodbergen
University of Groningen
4 shared publications - Suzanna Long
Department of Engineering Management and Systems Engineering, Missouri University of Science and Technology, Rolla, MO 65409, USA
4 shared publications
Latest Publications
- 19 June 2025
- Published by Emerald Publishing in Logistics Research
- Vol. 18 (1-2) , 23-45
Unidimensional puzzle-based storage systems
Purpose: A paradigm for Puzzle-Based Storage Systems (PBS) is that all grid cells have the capacity to move loads horizontally and vertically. This research challenges this paradigm by considering unidimensional PBS (UPBS), where some grid cells are limited to either horizontal or vertical movements. UPBS simultaneously reduce the investment cost and operational complexity of PBS, at the expense of a potentially lower system throughput. Design/methodology/approach: A linear program (LP) formulation is presented to determine the optimal retrieval path for a load using a single escort (i.e. an open cell in the grid that allows load movement) in a UPBS. The LP is solved recursively to understand the tradeoffs of unidimensional designs for a 4 × 4 system. Formulations to solve the single-load multi-escort problem are also proposed. Lastly, an existing decentralized control PBS algorithm was used to develop managerial insights for designing UPBS, considering the simultaneous retrieval of multiple loads using multiple escorts and input/output points. Findings: It is concluded that UPBS with three unidimensional cells would reduce the PBS cost by 1.8 times the capital cost of a bidimensional cell, at the expense of an 8.34% average reduction in throughput. It is argued that multi-escort UPBS designs should be similar to the ones empirically produced for single-escort UPBS. Lastly, it is concluded that UPBS may provide a favorable capital investment cost-to-throughput tradeoff. Originality/value: This study is a pioneer in considering UPBS. The empirical evidence of a favorable system cost-to-throughput ratio of UPBS improves the business case of implementing PBS in practice.
- 19 June 2025
- Published by Emerald Publishing in Logistics Research
- Vol. 18 (1-2) , 23-45
Unidimensional puzzle-based storage systems
Purpose: A paradigm for Puzzle-Based Storage Systems (PBS) is that all grid cells have the capacity to move loads horizontally and vertically. This research challenges this paradigm by considering unidimensional PBS (UPBS), where some grid cells are limited to either horizontal or vertical movements. UPBS simultaneously reduce the investment cost and operational complexity of PBS, at the expense of a potentially lower system throughput. Design/methodology/approach: A linear program (LP) formulation is presented to determine the optimal retrieval path for a load using a single escort (i.e. an open cell in the grid that allows load movement) in a UPBS. The LP is solved recursively to understand the tradeoffs of unidimensional designs for a 4 × 4 system. Formulations to solve the single-load multi-escort problem are also proposed. Lastly, an existing decentralized control PBS algorithm was used to develop managerial insights for designing UPBS, considering the simultaneous retrieval of multiple loads using multiple escorts and input/output points. Findings: It is concluded that UPBS with three unidimensional cells would reduce the PBS cost by 1.8 times the capital cost of a bidimensional cell, at the expense of an 8.34% average reduction in throughput. It is argued that multi-escort UPBS designs should be similar to the ones empirically produced for single-escort UPBS. Lastly, it is concluded that UPBS may provide a favorable capital investment cost-to-throughput tradeoff. Originality/value: This study is a pioneer in considering UPBS. The empirical evidence of a favorable system cost-to-throughput ratio of UPBS improves the business case of implementing PBS in practice.
- 11 April 2023
- Published by Taylor & Francis in Transportation Letters
- Vol. 16 (5) , 428-438
An integrated ride-sharing and parking allocation system
This study introduces a new policy for managing parking scarcity called Parking Allocation and Ride-Sharing System (PARS). In PARS, a centralized algorithm allocates parking spacesto drivers who are willing to participate in a coordinated carpool. The algorithm is used to optimize the creation of carpools going to and returning from a particular venue and simultaneously reserve parking for these carpools at the venue. An efficient mixed integer linear programming (MIP) formulation is presented and two heuristics, namely Ride Decomposition (RD) and Quick Converge (QC), are proposed and compared via internally generated experiments. Experimental results show that a commercial solver is able to solve the MIP with thousands of individuals to optimality in minutes. For larger instances, the RD and QC heuristic algorithms can solve the problem, on average, 42.23% and 86.39% faster than the commercial solver and provide solutions that are 3.61% and 3.49% from optimal, respectively.
- 11 April 2023
- Published by Taylor & Francis in Transportation Letters
- Vol. 16 (5) , 428-438
An integrated ride-sharing and parking allocation system
This study introduces a new policy for managing parking scarcity called Parking Allocation and Ride-Sharing System (PARS). In PARS, a centralized algorithm allocates parking spacesto drivers who are willing to participate in a coordinated carpool. The algorithm is used to optimize the creation of carpools going to and returning from a particular venue and simultaneously reserve parking for these carpools at the venue. An efficient mixed integer linear programming (MIP) formulation is presented and two heuristics, namely Ride Decomposition (RD) and Quick Converge (QC), are proposed and compared via internally generated experiments. Experimental results show that a commercial solver is able to solve the MIP with thousands of individuals to optimality in minutes. For larger instances, the RD and QC heuristic algorithms can solve the problem, on average, 42.23% and 86.39% faster than the commercial solver and provide solutions that are 3.61% and 3.49% from optimal, respectively.
- 1 September 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 55 (5) , 1151-1169
A Special Case of the Multiple Traveling Salesmen Problem in End-of-Aisle Picking Systems
This study focuses on the problem of sequencing requests for an end-of-aisle automated storage and retrieval system in which each retrieved load must be returned to its earlier storage location after a worker has picked some products from the load. At the picking station, a buffer is maintained to absorb any fluctuations in speed between the worker and the storage/retrieval machine. We show that, under conditions, the problem of optimally sequencing the requests in this system with a buffer size of m loads forms a special case of the multiple traveling salesmen problem in which each salesman visits the same number of cities. Several interesting structural properties for the problem are mathematically shown. In addition, a branch-and-cut method and heuristics are proposed. Experimental results show that the proposed simulated annealing-based heuristic performs well in all circumstances and significantly outperforms benchmark heuristics. For instances with negligible picking times for the worker, we show that this heuristic provides solutions that are, on average, within 1.8% from the optimal value.
- 1 September 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 55 (5) , 1151-1169
A Special Case of the Multiple Traveling Salesmen Problem in End-of-Aisle Picking Systems
This study focuses on the problem of sequencing requests for an end-of-aisle automated storage and retrieval system in which each retrieved load must be returned to its earlier storage location after a worker has picked some products from the load. At the picking station, a buffer is maintained to absorb any fluctuations in speed between the worker and the storage/retrieval machine. We show that, under conditions, the problem of optimally sequencing the requests in this system with a buffer size of m loads forms a special case of the multiple traveling salesmen problem in which each salesman visits the same number of cities. Several interesting structural properties for the problem are mathematically shown. In addition, a branch-and-cut method and heuristics are proposed. Experimental results show that the proposed simulated annealing-based heuristic performs well in all circumstances and significantly outperforms benchmark heuristics. For instances with negligible picking times for the worker, we show that this heuristic provides solutions that are, on average, within 1.8% from the optimal value.
- 4 September 2020
- Published by American Society for Engineering Education
- p. 22.1633.1-22.1633.8
Using Retrospective Assessment to Measure Levels of Student and Faculty Engagement in the Development of Sustainability Supply Chain and Facility Logistics Curriculum
Using Retrospective Assessment to Measure Levels of Student and Faculty Engagement in the Development of Sustainability Supply Chain and Facility Logistics CurriculumEngineering managers need in-depth knowledge and commitment to concepts of sustainability andglobalization to create infrastructures and processes capable of meeting the needs of 21st centurybusiness. Many efforts are underway to introduce these valuable concepts into engineeringmanagement and industrial engineering curriculum, but how deeply are these concepts beinginternalized by the students and faculty involved? This paper details the use of retrospectiveassessment by a multi-institutional partnership to measure the level of student and faculty engagementin the change process. This partnership includes two universities in the U.S., one in Puerto Rico, and onein Spain and is in the final year of an NSF funded project to integrate sustainability into supply chainmanagement and facility logistics curriculum across institutional boundaries and international timezones. Lessons learned from the assessment are used to identify progress toward learning andpedagogical development goals, as well as suggest measures for overcoming engagement barriers.
- 4 September 2020
- Published by American Society for Engineering Education
- p. 22.1633.1-22.1633.8
Using Retrospective Assessment to Measure Levels of Student and Faculty Engagement in the Development of Sustainability Supply Chain and Facility Logistics Curriculum
Using Retrospective Assessment to Measure Levels of Student and Faculty Engagement in the Development of Sustainability Supply Chain and Facility Logistics CurriculumEngineering managers need in-depth knowledge and commitment to concepts of sustainability andglobalization to create infrastructures and processes capable of meeting the needs of 21st centurybusiness. Many efforts are underway to introduce these valuable concepts into engineeringmanagement and industrial engineering curriculum, but how deeply are these concepts beinginternalized by the students and faculty involved? This paper details the use of retrospectiveassessment by a multi-institutional partnership to measure the level of student and faculty engagementin the change process. This partnership includes two universities in the U.S., one in Puerto Rico, and onein Spain and is in the final year of an NSF funded project to integrate sustainability into supply chainmanagement and facility logistics curriculum across institutional boundaries and international timezones. Lessons learned from the assessment are used to identify progress toward learning andpedagogical development goals, as well as suggest measures for overcoming engagement barriers.
- Open Access
- 3 September 2020
- Published by American Society for Engineering Education
- p. 15.248.1-15.248.9
Building Communication Skills In Supply Chain Management And Facility Logistics Curriculum Through Multi Institutional Virtual Teaming
- 3 September 2020
- Published by American Society for Engineering Education
- p. 15.248.1-15.248.9
Open AccessBuilding Communication Skills In Supply Chain Management And Facility Logistics Curriculum Through Multi Institutional Virtual Teaming
- Open Access
- 2 May 2018
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 7 (4) , 315-341
Reliable capacitated facility location problem with service levels
- 2 May 2018
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 7 (4) , 315-341
Open AccessReliable capacitated facility location problem with service levels
- 1 October 2017
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 112, 212-220
Transportation-location problem with unknown number of facilities
- 1 October 2017
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 112, 212-220
Transportation-location problem with unknown number of facilities
- Open Access
- 7 January 2016
- Published by Ubiquity Press, Ltd. in Data Science Journal
- Vol. 15
Post-Disaster Supply Chain Interdependent Critical Infrastructure System Restoration: A Review of Data Necessary and Available for Modeling
- 7 January 2016
- Published by Ubiquity Press, Ltd. in Data Science Journal
- Vol. 15
Open AccessPost-Disaster Supply Chain Interdependent Critical Infrastructure System Restoration: A Review of Data Necessary and Available for Modeling
- 1 November 2015
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 89, 23-33
Priority rules for twin automated stacking cranes that collaborate
- 1 November 2015
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 89, 23-33
Priority rules for twin automated stacking cranes that collaborate