|
|
|
|
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
ocn939404888 |
| 003 |
OCoLC |
| 005 |
20240909213021.0 |
| 006 |
m o d |
| 007 |
cr cnu|||unuuu |
| 008 |
160215s2016 enka ob 001 0 eng d |
| 040 |
|
|
|a N$T
|b eng
|e rda
|e pn
|c N$T
|d N$T
|d DG1
|d YDXCP
|d IDEBK
|d EBLCP
|d OCLCO
|d CDX
|d OCLCF
|d UMI
|d DEBBG
|d KSU
|d DEBSZ
|d RECBK
|d CCO
|d IDB
|d MERUC
|d DG1
|d LIP
|d OCLCQ
|d CHVBK
|d ZCU
|d OCLCQ
|d OCLCO
|d ICG
|d INT
|d OCLCQ
|d UKMGB
|d OCLCQ
|d U3W
|d OCLCQ
|d UAB
|d ESU
|d DKC
|d OCLCQ
|d UKAHL
|d OCLCQ
|d OCLCO
|d SGP
|d OCLCQ
|d OCLCO
|d OCLCL
|d OCLCQ
|d UEJ
|d OCLCQ
|
| 016 |
7 |
|
|a 017762534
|2 Uk
|
| 019 |
|
|
|a 945741044
|a 951602154
|a 992880256
|
| 020 |
|
|
|a 9781119136590
|q (electronic bk.)
|
| 020 |
|
|
|a 1119136598
|q (electronic bk.)
|
| 020 |
|
|
|a 9781119136583
|q (electronic bk.)
|
| 020 |
|
|
|a 111913658X
|q (electronic bk.)
|
| 020 |
|
|
|a 9781119136668
|
| 020 |
|
|
|a 1119136660
|
| 020 |
|
|
|z 9781848218086
|
| 035 |
|
|
|a (OCoLC)939404888
|z (OCoLC)945741044
|z (OCoLC)951602154
|z (OCoLC)992880256
|
| 037 |
|
|
|a CL0500000727
|b Safari Books Online
|
| 050 |
|
4 |
|a QA402.6
|
| 072 |
|
7 |
|a MAT
|x 003000
|2 bisacsh
|
| 072 |
|
7 |
|a MAT
|x 029000
|2 bisacsh
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a Deroussi, Laurent,
|e author.
|
| 245 |
1 |
0 |
|a Metaheuristics for logistics /
|c Laurent Deroussi.
|
| 264 |
|
1 |
|a London :
|b ISTE Ltd. ;
|a Hoboken, NJ :
|b John Wiley & Sons, Inc.,
|c 2016.
|
| 300 |
|
|
|a 1 online resource :
|b illustrations
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Computer engineering series. Metaheuristics set ;
|v volume 4
|
| 588 |
0 |
|
|a Online resource; title from PDF title page (Ebsco, viewed February 16, 2016).
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 520 |
|
|
|a This 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.
|
| 505 |
0 |
|
|a Table 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
|
| 505 |
8 |
|
|a 3.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
|
| 505 |
8 |
|
|a 6.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
|
| 505 |
8 |
|
|a 9.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
|
| 505 |
8 |
|
|a 12.1. The swing state problem12.2. Adel and his camels; 12.3. The forges of Sauron; Conclusion; Bibliography; Index; End User License Agreement
|
| 650 |
|
0 |
|a Transportation problems (Programming)
|
| 650 |
|
0 |
|a Mathematical optimization.
|
| 650 |
|
7 |
|a MATHEMATICS
|x Applied.
|2 bisacsh
|
| 650 |
|
7 |
|a MATHEMATICS
|x Probability & Statistics
|x General.
|2 bisacsh
|
| 650 |
|
7 |
|a Mathematical optimization
|2 fast
|
| 650 |
|
7 |
|a Transportation problems (Programming)
|2 fast
|
| 758 |
|
|
|i has work:
|a Metaheuristics for Logistics [electronic resource] (Text)
|1 https://id.oclc.org/worldcat/entity/E39PD3rTGBPKJfkrphDp9TBK4V
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Erscheint auch als:
|n Druck-Ausgabe
|
| 830 |
|
0 |
|a Computer engineering series (London, England).
|p Metaheuristics set ;
|v v. 4.
|
| 856 |
4 |
0 |
|u https://ebookcentral.proquest.com/lib/holycrosscollege-ebooks/detail.action?docID=4405836
|y Click for online access
|
| 903 |
|
|
|a EBC-AC
|
| 994 |
|
|
|a 92
|b HCD
|