Presses universitaires de Louvain onixsuitesupport@onixsuite.com 20260413 eng

COM.ONIXSUITE.9782390613350 03 01 Presses universitaires de Louvain 01 SKU 104929 02 2390613357 03 9782390613350 15 9782390613350 10 BC 00 Thèses de l'École polytechnique de Louvain 926 01 GCOI 29303100991180 1 A01 Charles Thomas Thomas, Charles Charles Thomas <p>Charles Thomas graduated from UCLouvain in 2016 with a Master degree in Computer Science with a major in Artificial Intelligence. His studies introduced him to the fields of Combinatorial Optimisation and Constraint Programming. Following his Master, he started a Ph.D. in Applied Sciences under the supervision of Prof. Pierre Schaus. During his Ph.D. Charles was involved computer science courses as teaching assistant. He was also collaborator for the PRESupply project, a research project financed by the Walloon Region which aimed at designing generic and affordable optimisation solutions in the domain of supply chain and operations for small and medium businesses.</p> 01 eng 160 00 160 03 COM000000 U 29 2012 3193 INFORMATIQUE 24 INTERNET Sciences appliquées 01 06 01 <p>This thesis presents the application of several constraint programming techniques to combinatorial problems. In particular, hybrid scheduling and routing problems such as Dial-A-Ride Problems (DARP) are explored. A variant of this problem, the Patient Transportation Problem (PTP) is formalized and resolved. Various approaches to model the PTP and DARP are studied, including a scheduling model and a classical successor model. The usage of sequence variables to model the routes of vehicles is investigated. Two different implementations of a sequence variable are presented as well as several global constraints used in conjunction with these variables to provide efficient propagation algorithms.<br /> Additionally, the use of an adaptive variant of the Large Neighborhood Search (LNS) is considered in a black-box context, without prior knowledge about the problem being solved. The approach studied uses a portfolio of different heuristics combined with a selection mechanism to adapt the heuristics used to the current problem during the search. Experimental results show the efficiency of the techniques proposed and hint at promising research directions in the domain of PTP-like problems, sequence variables and adaptive LNS.</p> 03 <p>This thesis presents the application of several constraint programming techniques to combinatorial problems. In particular, hybrid scheduling and routing problems such as Dial-A-Ride Problems (DARP) are explored. A variant of this problem, the Patient Transportation Problem (PTP) is formalized and resolved. Various approaches to model the PTP and DARP are studied, including a scheduling model and a classical successor model. The usage of sequence variables to model the routes of vehicles is investigated. Two different implementations of a sequence variable are presented as well as several global constraints used in conjunction with these variables to provide efficient propagation algorithms.<br /> Additionally, the use of an adaptive variant of the Large Neighborhood Search (LNS) is considered in a black-box context, without prior knowledge about the problem being solved. The approach studied uses a portfolio of different heuristics combined with a selection mechanism to adapt the heuristics used to the current problem during the search. Experimental results show the efficiency of the techniques proposed and hint at promising research directions in the domain of PTP-like problems, sequence variables and adaptive LNS.</p> 02 This thesis presents the application of several constraint programming techniques to combinatorial problems. In particular, hybrid scheduling and routing problems such as Dial-A-Ride Problems (DARP) are explored. A variant of this problem, the Patient Transportation Problem (PTP) is formalized and resolved. 04 <p>1 Introduction 1<br /> 2 Background 5<br /> 3 Adaptive Large Neighborhood Search 33<br /> 4 Patient Transportation Problem 47<br /> 5 Sequence Variables 73<br /> 6 Conclusion 117<br /> Bibliography 121</p> <p></p> 99 BE 06 03 01 https://pul.uclouvain.be/resources/titles/29303100991180/images/117ffc1acd844e431a4b73f0867adae5/HIGHQ/9782390613350.jpg 20230424 07 03 01 https://pul.uclouvain.be/resources/titles/29303100991180/images/117ffc1acd844e431a4b73f0867adae5/THUMBNAIL/9782390613350.jpg 20230424 02 https://pul.uclouvain.be/book/?GCOI=29303100991180 06 3052405007518 Presses universitaires de Louvain 01 06 3052405007518 Presses universitaires de Louvain Louvain-la-Neuve BE 04 20230424 454 2023 01 WORLD 01 9.45 in 02 6.30 in 08 9.38 oz 01 24 cm 02 16 cm 08 266 gr 06 3012405004818 CIACO - DUC 03 WORLD FR 01 2 20 1 02 00 02 02 STD 02 21.00 EUR BE S 21.00 17.36 3.64 06 3019000200508 Librairie Wallonie-Bruxelles 33 www.librairiewb.com/ http://www.librairiewb.com/ 02 FR 01 2 20 1 04 00 02 02 STD 02 21.00 EUR R 5.50 19.91 1.09