Differential equations methods for the Monge-Kantorevich mass transfer problem / / L.C. Evans, W. Gangbo |
Autore | Evans Lawrence C. <1949-> |
Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [1999] |
Descrizione fisica | 1 online resource (81 p.) |
Disciplina |
510 s
515/.35 |
Collana | Memoirs of the American Mathematical Society |
Soggetto topico |
Transportation problems (Programming)
Differential equations - Numerical solutions |
Soggetto genere / forma | Electronic books. |
ISBN | 1-4704-0242-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910480868303321 |
Evans Lawrence C. <1949-> | ||
Providence, Rhode Island : , : American Mathematical Society, , [1999] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Differential equations methods for the Monge-Kantorevich mass transfer problem / / L.C. Evans, W. Gangbo |
Autore | Evans Lawrence C. <1949-> |
Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [1999] |
Descrizione fisica | 1 online resource (81 p.) |
Disciplina |
510 s
515/.35 |
Collana | Memoirs of the American Mathematical Society |
Soggetto topico |
Transportation problems (Programming)
Differential equations - Numerical solutions |
ISBN | 1-4704-0242-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910788737003321 |
Evans Lawrence C. <1949-> | ||
Providence, Rhode Island : , : American Mathematical Society, , [1999] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Differential equations methods for the Monge-Kantorevich mass transfer problem / / L.C. Evans, W. Gangbo |
Autore | Evans Lawrence C. <1949-> |
Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [1999] |
Descrizione fisica | 1 online resource (81 p.) |
Disciplina |
510 s
515/.35 |
Collana | Memoirs of the American Mathematical Society |
Soggetto topico |
Transportation problems (Programming)
Differential equations - Numerical solutions |
ISBN | 1-4704-0242-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910812746003321 |
Evans Lawrence C. <1949-> | ||
Providence, Rhode Island : , : American Mathematical Society, , [1999] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Lectures on optimal transport / Luigi Ambrosio, Elia Brué, Daniele Semola |
Autore | Ambrosio, Luigi |
Pubbl/distr/stampa | Cham : Springer, c2021 |
Descrizione fisica | ix, 250 p. ; 24 cm |
Disciplina | 519.6 |
Altri autori (Persone) |
Brué, Eliaauthor
Semola, Danieleauthor |
Collana | Unitext, 2038-5714 ; 130 |
Soggetto topico |
Mathematical optimization
Transportation problems (Programming) |
ISBN | 9783030721619 |
Classificazione |
AMS 49-01
AMS 49NXX LC QA402.5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991004265224007536 |
Ambrosio, Luigi | ||
Cham : Springer, c2021 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Mass transportation problems / Svetlozar T. Rachev, Ludger Ruschendorf |
Autore | Rachev, Svetlozar Todorov |
Pubbl/distr/stampa | New York : Springer-Verlag, c1998 |
Descrizione fisica | 2 v. : ill. ; 25 cm. |
Disciplina | 519.72 |
Altri autori (Persone) | Ruschendorf, Ludgerauthor |
Collana | Probability and its applications |
Soggetto topico | Transportation problems (Programming) |
ISBN |
038798352X (v. 2)
0387983503 (v. 1) |
Classificazione |
AMS 60B
AMS 60B11 AMS 60E99 AMS 60K30 AMS 90C QA402.6.R33 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991001103629707536 |
Rachev, Svetlozar Todorov | ||
New York : Springer-Verlag, c1998 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Metaheuristics for logistics . Volume 4 / / Laurent Deroussi |
Autore | Deroussi Laurent |
Edizione | [1st edition] |
Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : iSTE : , : Wiley, , 2016 |
Descrizione fisica | 1 online resource (177 p.) |
Disciplina | 388.310285 |
Collana | Computer Engineering Series |
Soggetto topico |
Transportation problems (Programming)
Mathematical optimization |
ISBN |
1-119-13666-0
1-119-13659-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
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
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 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 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 12.1. The swing state problem12.2. Adel and his camels; 12.3. The forges of Sauron; Conclusion; Bibliography; Index; End User License Agreement |
Record Nr. | UNINA-9910136251603321 |
Deroussi Laurent | ||
London, England ; ; Hoboken, New Jersey : , : iSTE : , : Wiley, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Metaheuristics for logistics . Volume 4 / / Laurent Deroussi |
Autore | Deroussi Laurent |
Edizione | [1st edition] |
Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : iSTE : , : Wiley, , 2016 |
Descrizione fisica | 1 online resource (177 p.) |
Disciplina | 388.310285 |
Collana | Computer Engineering Series |
Soggetto topico |
Transportation problems (Programming)
Mathematical optimization |
ISBN |
1-119-13666-0
1-119-13659-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
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
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 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 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 12.1. The swing state problem12.2. Adel and his camels; 12.3. The forges of Sauron; Conclusion; Bibliography; Index; End User License Agreement |
Record Nr. | UNINA-9910812487503321 |
Deroussi Laurent | ||
London, England ; ; Hoboken, New Jersey : , : iSTE : , : Wiley, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Metaheuristics for vehicle routing problems / / Nacima Labadie, Christian Prins, Caroline Prodhon |
Autore | Labadie Nacima |
Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : iSTE : , : Wiley, , 2016 |
Descrizione fisica | 1 online resource (197 p.) |
Disciplina | 388.310285 |
Collana | Computer Engineering Series. Metaheuristics Set |
Soggetto topico |
Transportation problems (Programming)
Mathematical optimization |
ISBN |
1-119-13678-4
1-119-13676-8 1-119-13677-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover; Title Page; Copyright; Contents; Notations and Abbreviations; Notations; Abbreviations related to problems; Abbreviations related to methods; Introduction; Chapter 1. General Presentation of Vehicle Routing Problems; 1.1. Logistics management and combinatorial optimization; 1.1.1. History of logistics; 1.1.2. Logistics as a science; 1.1.3. Combinatorial optimization; 1.2. Vehicle routing problems; 1.2.1. Problems in transportation optimization; 1.2.2. Vehicle routing problems in other contexts; 1.2.3. Characteristics of vehicle routing problems; 1.2.3.1. Components
1.2.3.2. Constraints1.2.3.3. Objectives; 1.2.4. The capacitated vehicle routing problem; 1.2.4.1. Mathematical model; 1.2.4.2. Solution methods; 1.3. Conclusion; Chapter 2. Simple Heuristics and Local Search Procedures; 2.1. Simple heuristics; 2.1.1. Constructive heuristics; 2.1.2. Two-phase methods; 2.1.3. Best-of approach and randomization; 2.2. Local search; 2.2.1. Principle; 2.2.2. Classical moves; 2.2.3. Feasibility tests; 2.2.4. General approach from Vidal et al.; 2.2.5. Multiple neighborhoods; 2.2.6. Very constrained problems; 2.2.7. Acceleration techniques; 2.2.8. Complex moves 2.3. ConclusionChapter 3. Metaheuristics Generating a Sequence of Solutions; 3.1. Simulated annealing (SA); 3.1.1. Principle; 3.1.2. Simulated annealing in vehicle routing problems; 3.2. Greedy randomized adaptive search procedure: GRASP; 3.2.1. Principle; 3.2.2. GRASP in vehicle routing problems; 3.3. Tabu search; 3.3.1. Principle; 3.3.2. Tabu search in vehicle routing problems; 3.4. Variable neighborhood search; 3.4.1. Principle; 3.4.2. Variable neighborhood search in vehicle routing problems; 3.5. Iterated local search; 3.5.1. Principle 3.5.2. Iterated local search in vehicle routing problems3.6. Guided local search; 3.6.1. Principle; 3.6.2. Guided local search in vehicle routing problems; 3.7. Large neighborhood search; 3.7.1. Principle; 3.7.2. Large neighborhood search in vehicle routing problems; 3.8. Transitional forms; 3.8.1. Evolutionary local search principle; 3.8.2. Application to vehicle routing problems; 3.9. Selected examples; 3.9.1. GRASP for the location-routing problem; 3.9.2. Granular tabu search for the CVRP; 3.9.3. Adaptive large neighborhood search for the pickup and delivery problem with time windows 3.10. ConclusionChapter 4. Metaheuristics Based on a Set of Solutions; 4.1. Genetic algorithm and its variants; 4.1.1. Genetic algorithm; 4.1.2. Memetic algorithm; 4.1.3. Memetic algorithm with population management; 4.1.4. Genetic algorithm and its variants in vehicle routing problems; 4.2. Scatter search; 4.2.1. Scatter search principle; 4.2.2. Scatter search in vehicle routing problems; 4.3. Path relinking; 4.3.1. Principle; 4.3.2. Path relinking in vehicle routing problems; 4.4. Ant colony optimization; 4.4.1. Principle; 4.4.2. ACO in vehicle routing problems 4.5. Particle swarm optimization |
Record Nr. | UNINA-9910136252503321 |
Labadie Nacima | ||
London, England ; ; Hoboken, New Jersey : , : iSTE : , : Wiley, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Metaheuristics for vehicle routing problems / / Nacima Labadie, Christian Prins, Caroline Prodhon |
Autore | Labadie Nacima |
Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : iSTE : , : Wiley, , 2016 |
Descrizione fisica | 1 online resource (197 p.) |
Disciplina | 388.310285 |
Collana | Computer Engineering Series. Metaheuristics Set |
Soggetto topico |
Transportation problems (Programming)
Mathematical optimization |
ISBN |
1-119-13678-4
1-119-13676-8 1-119-13677-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover; Title Page; Copyright; Contents; Notations and Abbreviations; Notations; Abbreviations related to problems; Abbreviations related to methods; Introduction; Chapter 1. General Presentation of Vehicle Routing Problems; 1.1. Logistics management and combinatorial optimization; 1.1.1. History of logistics; 1.1.2. Logistics as a science; 1.1.3. Combinatorial optimization; 1.2. Vehicle routing problems; 1.2.1. Problems in transportation optimization; 1.2.2. Vehicle routing problems in other contexts; 1.2.3. Characteristics of vehicle routing problems; 1.2.3.1. Components
1.2.3.2. Constraints1.2.3.3. Objectives; 1.2.4. The capacitated vehicle routing problem; 1.2.4.1. Mathematical model; 1.2.4.2. Solution methods; 1.3. Conclusion; Chapter 2. Simple Heuristics and Local Search Procedures; 2.1. Simple heuristics; 2.1.1. Constructive heuristics; 2.1.2. Two-phase methods; 2.1.3. Best-of approach and randomization; 2.2. Local search; 2.2.1. Principle; 2.2.2. Classical moves; 2.2.3. Feasibility tests; 2.2.4. General approach from Vidal et al.; 2.2.5. Multiple neighborhoods; 2.2.6. Very constrained problems; 2.2.7. Acceleration techniques; 2.2.8. Complex moves 2.3. ConclusionChapter 3. Metaheuristics Generating a Sequence of Solutions; 3.1. Simulated annealing (SA); 3.1.1. Principle; 3.1.2. Simulated annealing in vehicle routing problems; 3.2. Greedy randomized adaptive search procedure: GRASP; 3.2.1. Principle; 3.2.2. GRASP in vehicle routing problems; 3.3. Tabu search; 3.3.1. Principle; 3.3.2. Tabu search in vehicle routing problems; 3.4. Variable neighborhood search; 3.4.1. Principle; 3.4.2. Variable neighborhood search in vehicle routing problems; 3.5. Iterated local search; 3.5.1. Principle 3.5.2. Iterated local search in vehicle routing problems3.6. Guided local search; 3.6.1. Principle; 3.6.2. Guided local search in vehicle routing problems; 3.7. Large neighborhood search; 3.7.1. Principle; 3.7.2. Large neighborhood search in vehicle routing problems; 3.8. Transitional forms; 3.8.1. Evolutionary local search principle; 3.8.2. Application to vehicle routing problems; 3.9. Selected examples; 3.9.1. GRASP for the location-routing problem; 3.9.2. Granular tabu search for the CVRP; 3.9.3. Adaptive large neighborhood search for the pickup and delivery problem with time windows 3.10. ConclusionChapter 4. Metaheuristics Based on a Set of Solutions; 4.1. Genetic algorithm and its variants; 4.1.1. Genetic algorithm; 4.1.2. Memetic algorithm; 4.1.3. Memetic algorithm with population management; 4.1.4. Genetic algorithm and its variants in vehicle routing problems; 4.2. Scatter search; 4.2.1. Scatter search principle; 4.2.2. Scatter search in vehicle routing problems; 4.3. Path relinking; 4.3.1. Principle; 4.3.2. Path relinking in vehicle routing problems; 4.4. Ant colony optimization; 4.4.1. Principle; 4.4.2. ACO in vehicle routing problems 4.5. Particle swarm optimization |
Record Nr. | UNINA-9910828951403321 |
Labadie Nacima | ||
London, England ; ; Hoboken, New Jersey : , : iSTE : , : Wiley, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Modeling and optimization in green logistics / / edited by Houda Derbel, Bassem Jarboui, Patrick Siarry |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
Descrizione fisica | 1 online resource (XIV, 168 p. 36 illus., 32 illus. in color.) |
Disciplina | 006.3 |
Soggetto topico |
Transportation problems (Programming)
Vehicle routing problem |
ISBN | 3-030-45308-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The Green-Vehicle Routing Problem: A Survey -- An Integrated Location-Inventory Routing Problem for ATMs in Banking Industry: A Green Approach -- Modelling a Future Routing Concept for Urban Air Mobility -- Putting the SC in SCORE: Solar Car Optimized Route Estimation and Smart Cities -- Evaluation and Prioritisation of Green Logistics and Transportation Practices Used in the Freight Transport Industry -- A Novel Hybrid Multi-objective Optimization Approach for Sustainable Delivery Systems with A Case Study in Izmir -- When Green Technology Meets Optimization Modelling: The Case of Routing Drones in Logistics, Agriculture and Healthcare -- Routing Electric Vehicles with Remote Servicing. |
Record Nr. | UNINA-9910447244803321 |
Cham, Switzerland : , : Springer, , [2020] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|