Search

Your search keyword '"Lotte Berghman"' showing total 23 results
Start Over Author "Lotte Berghman"
23 results on '"Lotte Berghman"'

11. Using flexible crossdock schedules to face truck arrivals uncertainty

Author

Cyril Briand, Quentin Fabry, Lotte Berghman, Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Toulouse Business School (TBS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Alexandre Dolgui, Alain Bernard, David Lemoine, Gregor von Cieminski, David Romero, TC5, WG 5,7, and ANR-18-CE10-0007,PER4MANCE,Planification Et Répartition Flexible du travail entre les OpérateuRs des chaînes d'asseMblage AéroNautiques : une approChe systémique pour gérer les risques Ergonomiques et économiques(2018)

Subjects
Truck, Flexibility (engineering), 0209 industrial biotechnology, Schedule, 021103 operations research, Operations research, Computer science, Scheduling, 0211 other engineering and technologies, ComputerApplications_COMPUTERSINOTHERSYSTEMS, Groups of permutable operations, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Truck scheduling, Scheduling (computing), 020901 industrial engineering & automation, Robustness (computer science), Face (geometry), Pallet, Crossdocking, Robustness
Abstract

International audience; This paper discusses the use of robust schedules for facing uncertainty arising in crossdock truck scheduling problems. Groups of permutable operations bring sequential flexibility in the schedule, allowing to deal with late or early truck arrivals as the total order and the starting times can be determined in a reactive manner. We focus on the evaluation of a robust schedule considering both the worst maximal lateness of the trucks and the worst total sojourn time of the pallets. We also show how a robust schedule can be evaluated online, taking into account the actual arrival times of the trucks.

Published
2021
Full Text
View/download PDF

12. On the complexity of the crossdock truck-scheduling problem

Author

Quentin Fabry, Alessandro Agnetis, Lotte Berghman, Cyrille Briand, Fabry, Quentin, Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Università degli Studi di Siena = University of Siena (UNISI), Toulouse Business School (TBS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), and ANR-18-CE10-0007,PER4MANCE,Planification Et Répartition Flexible du travail entre les OpérateuRs des chaînes d'asseMblage AéroNautiques : une approChe systémique pour gérer les risques Ergonomiques et économiques(2018)

Subjects
crossdocking, [SPI]Engineering Sciences [physics], truck scheduling, [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [SPI] Engineering Sciences [physics], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], complexity, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2021

13. Integrated production and delivery problem: case of several manufacturers and one customer

Author

Hugo Chevroton, Yannick Kergosien, Lotte Berghman, Recherche Opérationnelle, Ordonnancement, Transport ERL 7002 (ROOT), Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT), Centre National de la Recherche Scientifique (CNRS)-Université de Tours-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université de Tours-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), and Toulouse Business School (TBS)

Subjects
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2021

14. Problème intégré de production et de livraison : cas de plusieurs producteurs et un client

Author

Hugo Chevroton, Yannick Kergosien, Lotte Berghman, Billaut Jean-Charles, Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT), Université de Tours-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Recherche Opérationnelle, Ordonnancement, Transport ERL 7002 (ROOT), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université de Tours-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Toulouse Business School (TBS), Kergosien, Yannick, Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL)

Subjects
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2020

15. The Truck Scheduling Problem at Crossdocking Terminals - Exclusive versus Mixed Mode

Author

Roel Leus, Pierre Lopez, Lotte Berghman, Cyril Briand, Toulouse Business School, Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Department of Computer Science - K.U.Leuven, Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), and Université de Toulouse (UT)

Subjects
Truck, crossdocking, 021103 operations research, Operations research, Computer science, Real-time computing, 0211 other engineering and technologies, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Truck scheduling, Mixed mode, parallel machine scheduling, Warehouse, Scheduling (computing), truck scheduling, DOCK, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Integer programming, integer programming, Intermediate storage
Abstract

International audience; In this paper we study the scheduling of the docking operations of trucks at a warehouse; each truck is either empty and needs to be loaded, or full and has to be unloaded (but not both). We focus on crossdocking, which is a recent warehouse concept that favors the transfers of as many incoming products as possible directly to outgoing trailers, without intermediate storage in the warehouse. We propose a time-indexed integer programming formulation for scheduling the loading and unloading of the trucks at the docks, and we distinguish between a so-called " mixed mode " , in which some or all of the docks can be used both for loading as well as unloading, and an " exclusive mode " , in which each dock is dedicated to only one of the two types of operations. Computational experiments are provided to compare the efficiency of the two modes.

Published
2015
Full Text
View/download PDF

16. Solving a time-indexed formulation by preprocessing and cutting planes

Author

Lotte Berghman, Frits C. R. Spieksma, Vincent t'Kindt, Maurel, Denis, Operations Research and Business Statistics (ORSTAT), Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven), Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT), Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Machine scheduling, Mathematical optimization, 021103 operations research, [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], Time-indexed formulation, 0211 other engineering and technologies, Unrelated machine scheduling, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Valid inequalities, 010201 computation theory & mathematics, Preprocessor, Cutting plane algorithm, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Variable fixing, Algorithm, Mathematics
Abstract

We consider a time-indexed formulation for the unrelated parallel machine scheduling problem. We show that all polyhedral knowledge known from the single machine problem (in particular, valid inequalities) is applicable to this formulation. We present new facet-inducing valid inequalities and a preprocessing technique involving fixing variables based on reduced costs. We combine both techniques in a basic cutting-plane algorithm and test the performance of the resulting algorithm by running it on randomly generated instances. ispartof: FEB Research Report KBI_1407 nrpages: 26 status: published

Published
2013

17. The truck scheduling problem at cross-docking terminals

Author

Lotte Berghman, Cyrille Briand, Roel Leus, Pierre Lopez, Operations Research and Business Statistics (ORSTAT), Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven), LAAS-MOGISA, Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), and Université Fédérale Toulouse Midi-Pyrénées

Subjects
Computer Science::Computational Engineering, Finance, and Science, ComputerApplications_COMPUTERSINOTHERSYSTEMS, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
Abstract

International audience; We study the general case of crossdocking, in which each dock can be used both for loading and unloading (so-called mixed mode). We propose a time-indexed linear programming formulation and a branch-and- bound algorithm to solve the problem.

Published
2012

18. Computational Experiments with a Cutting-Plane Algorithm for a Time-Indexed Formulation

Author

Lotte Berghman and Frits C. R. Spieksma

Subjects
Mathematical optimization, Machine scheduling, Computer science, Algorithm, Cutting plane algorithm, Fair-share scheduling
Abstract

We consider a time-indexed formulation for the unrelated parallel machine scheduling problem. We show that all polyhedral knowledge known from the single machine problem (in particular, valid inequalities) is applicable to this formulation. We also present new valid inequalities, and we implement a basic cutting-plane algorithm based on these inequalities. Its performance is tested by running it on randomly generated instances.

Published
2012
Full Text
View/download PDF

19. A Lagrangian heuristic for a dock assignment problem with trailer transportation

Author

Lotte Berghman and Roel Leus

Subjects
Tractor, Engineering, Mathematical optimization, business.product_category, Job shop scheduling, business.industry, Trailer, Flow shop scheduling, symbols.namesake, Terminal (electronics), Lagrangian relaxation, Parking lot, symbols, business, Assignment problem
Abstract

This paper presents a Lagrangian heuristic that combines Lagrangian relaxation with an enumerative search tree for finding high-quality solutions to a dock assignment problem. Trailers are assigned to gates for loading or unloading activities; the parking lot is used as a buffer zone. Transportation between the parking lot and the gates is performed by additional resources called terminal tractors. After loading or unloading, a trailer cannot be transported to the parking lot by a terminal tractor if all tractors are busy. The trailer remains at the gate until a terminal tractor becomes available, which may prevent other trailers from being loaded or unloaded there. We refer to this phenomenon as blocking. The problem is modeled as a threestage flexible flow shop.

Published
2010
Full Text
View/download PDF

20. Optimal Solutions for a Dock Assignment Problem with Trailer Transportation

Author

Roel Leus, Lotte Berghman, and Frits C. R. Spieksma

Subjects
Mathematical optimization, Branch and bound, Computer science, Tardiness, Trailer, General Decision Sciences, Flow shop scheduling, Management Science and Operations Research, GeneralLiterature_MISCELLANEOUS, Tabu search, Set (abstract data type), symbols.namesake, Lagrangian relaxation, DOCK, Theory of computation, Parking lot, symbols, Beam search, Assignment problem, Integer programming, Mathematics
Abstract

We study a distribution warehouse in which trailers need to be assigned to docks for loading or unloading. A parking lot is used as a buffer zone and transportation between the parking lot and the docks is performed by auxiliary resources called terminal tractors. Each incoming trailer has a known arrival time and each outgoing trailer a desired departure time. The primary objective is to produce a docking schedule such that the weighted sum of the number of late outgoing trailers and the tardiness of these trailers is minimized; the secondary objective is to minimize the weighted completion time of all trailers, both incoming and outgoing. The purpose of this paper is to produce high-quality solutions to large instances that are comparable to a real-life case. We implement several heuristic algorithms: truncated branch and bound, beam search and tabu search. Lagrangian relaxation is embedded in the algorithms for constructing an initial solution and for computing lower bounds. The different solution frameworks are compared via extensive computational experiments.

Published
2010
Full Text
View/download PDF

21. Solving a dock assignment problem as a three-stage flexible flow-shop problem

Author

Lotte Berghman and Roel Leus

Subjects
Mathematical optimization, Engineering, Job shop scheduling, business.industry, Flow shop scheduling, Set (abstract data type), symbols.namesake, Lagrangian relaxation, DOCK, symbols, Parking lot, business, Assignment problem, Generalized assignment problem
Abstract

This paper presents a model for a dock assignment problem based on the situation encountered in a practical case. Trailers are assigned to gates during a specific period in time for loading or unloading activities. The parking lot is used as a buffer zone. Transportation between the parking lot and the gates is performed by additional resources called terminal tractors. The problem is modeled as a three-stage flexible flow shop, where the first and the third stage share the same identical parallel machines and besides that, all stages share a different set of identical parallel machines. Different mathematical formulations are given and a Lagrangian relaxation approach is examined to solve this flexible flow-shop problem. ©2009 IEEE. ispartof: pages:320-324 ispartof: The IEEE International Conference on Industrial Engineering and Engineering Management. Proceedings pages:320-324 ispartof: 2009 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2009) location:Hong Kong (China) date:8 Dec - 11 Dec 2009 status: published

Published
2009
Full Text
View/download PDF

22. Efficient solutions for Mastermind using genetic algorithms

Author

Roel Leus, Dries Goossens, and Lotte Berghman

Subjects
Set (abstract data type), General Computer Science, Large set (Ramsey theory), Modeling and Simulation, Genetic algorithm, Management Science and Operations Research, Expected value, Algorithm, Game theory, Selection (genetic algorithm), Metamodeling, Mathematics
Abstract

We present a new genetic algorithm for playing the game of Mastermind. The algorithm requires low run-times and results in a low expected number of guesses. Its performance is comparable to that of other meta-heuristics for the standard setting with four positions and six colors, while it outperforms the existing algorithms when more colors and positions are examined. The central idea underlying the algorithm is the creation of a large set of eligible guesses collected throughout the different generations of the genetic algorithm, the quality of each of which is subsequently determined based on a comparison with a selection of elements of the set. © 2008 Elsevier Ltd. All rights reserved. ispartof: Computers & operations research vol:36 issue:6 pages:1880-1885 status: published

Published
2009

23. Solving an integrated scheduling and routing problem with inventory, routing and penalty costs

Author

Lotte Berghman, Jean-Charles Billaut, Yannick Kergosien, Hugo Chevroton, Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT), Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Recherche Opérationnelle, Ordonnancement, Transport ERL 7002 (ROOT), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Toulouse Business School (TBS), Université de Tours-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université de Tours-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL)

Subjects
050210 logistics & transportation, Schedule, Mathematical optimization, 021103 operations research, Information Systems and Management, General Computer Science, Job shop scheduling, Computer science, Total cost, Tardiness, 05 social sciences, 0211 other engineering and technologies, Scheduling (production processes), 02 engineering and technology, Flow shop scheduling, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Management Science and Operations Research, Industrial and Manufacturing Engineering, Scheduling (computing), Modeling and Simulation, 0502 economics and business, Routing (electronic design automation), ComputingMilieux_MISCELLANEOUS
Abstract

This paper considers an integrated routing and scheduling problem where the routing part takes into account routing costs and tardiness penalties and the scheduling part is modelled by a permutation flow shop with inventory costs. We assume that each batch is served by a dedicated vehicle, and that the number of batches and their compositions (the number of jobs and the parameters of those jobs) are known in advance. The problem is to determine the starting times of the jobs on each machine in the flow shop, the departure dates of the batches and their delivery route, such that the total cost (sum of inventory, routing and penalty costs) is minimised. A two-step approach is proposed. In a first step, the optimal delivery routes for each batch and each possible departure date are calculated. This is possible as determining the min cost route for a particular delivery batch and a particular departure date is easy. In a second step, we use the delivery cost function for each batch, depending on the departure date, from the first step, to find a schedule that minimises the total cost. Computational experiments are performed on randomly generated instances.

Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results