LEADER 05053nam 2200637 450 001 9910812487503321 005 20200520144314.0 010 $a1-119-13666-0 010 $a1-119-13659-8 035 $a(CKB)3710000000596067 035 $a(EBL)4405836 035 $a(WaSeSS)IndRDA00117515 035 $a(Au-PeEL)EBL4405836 035 $a(CaPaEBR)ebr11155982 035 $a(CaONFJC)MIL897663 035 $a(OCoLC)939404888 035 $a(CaSebORM)9781848218086 035 $a(MiAaPQ)EBC4405836 035 $a(PPN)245185674 035 $a(EXLCZ)993710000000596067 100 $a20160607h20162016 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aMetaheuristics for logistics$hVolume 4 /$fLaurent Deroussi 205 $a1st edition 210 1$aLondon, England ;$aHoboken, New Jersey :$ciSTE :$cWiley,$d2016. 210 4$dİ2016 215 $a1 online resource (177 p.) 225 1 $aComputer Engineering Series 300 $aDescription based upon print version of record. 311 $a1-84821-808-7 311 $a1-119-13658-X 320 $aIncludes bibliographical references and index. 327 $aTable of Contents; Title; Copyright; Introduction; PART 1: Basic Notions; 1 Introductory Problems; 1.1. The "swing states" problem; 1.2. Adel and his camels; 1.3. Sauron's forges; 2 A Review of Logistic Problems; 2.1. Some history; 2.2. Some polynomial problems; 2.3. Packing problems; 2.4. Routing problems; 2.5. Production scheduling problems; 2.6. Lot-sizing problems; 2.7. Facility location problems; 2.8. Conclusion; 3 An Introduction to Metaheuristics; 3.1. Optimization problems; 3.2. Metaheuristics: basic notions; 3.3. Individual-based metaheuristics; 3.4. Population-based metaheuristics 327 $a3.5. Conclusion4 A First Implementation of Metaheuristics; 4.1. Representing a list of objects; 4.2. The implementation of a local search; 4.3. The implementation of individual-based metaheuristics; 4.14. Conclusion; PART 2: Advanced Notions; 5 The Traveling Salesman Problem; 5.1. Representing a solution: the two-level tree structure; 5.2. Constructing initial solutions; 5.3. Neighborhood systems; 5.4. Some results; 5.5. Conclusion; 6 The Flow-Shop Problem; 6.1. Representation and assessment of a solution; 6.2. Construction of the initial solution; 6.3. Neighborhood systems; 6.4. Results 327 $a6.5. Conclusion7 Some Elements for Other Logistic Problems; 7.1. Direct representation versus indirect representation; 7.2. Conditioning problems; 7.3. Lot-sizing problems; 7.4. Localization problems; 7.5. Conclusion; PART 3: Evolutions and Current Trends; 8 Supply Chain Management; 8.1. Introduction to supply chain management; 8.2. Horizontal synchronization of the supply chain; 8.3. Vertical synchronization of a supply chain; 8.4. An integral approach of the supply chain; 8.5. Conclusion; 9 Hybridization and Coupling Using Metaheuristics 327 $a9.1. Metaheuristics for the optimization of the supply chain9.2. Hybridization of optimization methods; 9.3. Coupling of optimization methods and performance evaluations; 9.4. Conclusion; 10 Flexible Manufacturing Systems; 10.1. Introduction to the FMS challenges; 10.2. The job-shop problem with transport; 10.3. Proposal for a metaheuristic/simulation coupling; 10.4. Workshop layout problem; 10.5. Conclusion; 11 Synchronization Problems Based on Vehicle Routings; 11.1. Inventory routing problem; 11.2. The location-routing problem; 11.3. Conclusion; 12 Solution to Problems 327 $a12.1. The swing state problem12.2. Adel and his camels; 12.3. The forges of Sauron; Conclusion; Bibliography; Index; End User License Agreement 330 $aThis book describes the main classical combinatorial problems that can be encountered when designing a logistics network or driving a supply chain. It shows how these problems can be tackled by metaheuristics, both separately and using an integrated approach. A huge number of techniques, from the simplest to the most advanced ones, are given for helping the reader to implement efficient solutions that meet its needs. A lot of books have been written about metaheuristics (methods for solving hard optimization problems) and supply chain management (the field in which we find a huge number of combinatorial optimization problems) in the last decades. So, the main reason of this book is to describe how these methods can be implemented for this class of problems. 410 0$aComputer engineering series (London, England) 606 $aTransportation problems (Programming) 606 $aMathematical optimization 615 0$aTransportation problems (Programming) 615 0$aMathematical optimization. 676 $a388.310285 700 $aDeroussi$b Laurent$01663956 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910812487503321 996 $aMetaheuristics for logistics$94021669 997 $aUNINA