Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Aggregation Operators for Various Extensions of Fuzzy Set and Its Applications in Transportation Problems / / by Akansha Mishra, Amit Kumar
| Aggregation Operators for Various Extensions of Fuzzy Set and Its Applications in Transportation Problems / / by Akansha Mishra, Amit Kumar |
| Autore | Mishra Akansha |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (276 pages) |
| Disciplina | 388.310285 |
| Collana | Studies in Fuzziness and Soft Computing |
| Soggetto topico |
Computational intelligence
Artificial intelligence Transportation engineering Traffic engineering Operator theory Computational Intelligence Artificial Intelligence Transportation Technology and Traffic Engineering Operator Theory |
| ISBN | 981-15-6998-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Appropriate Weighted Averaging Aggregation Operator Under Some Extensions of the Fuzzy Environment -- Chapter 2. Mehar Method to Find a Unique Fuzzy Optimal Value of Balanced Fully Triangular Fuzzy Transportation Problems -- Chapter 3. Vaishnavi Approach for Solving Triangular Intuitionistic Transportation Problems of Type-2 -- Chapter 4. JMD Approach for Solving Unbalanced Fully Trapezoidal Intuitionistic Fuzzy Transportation Problems -- Chapter 5. JMD Approach for Solving Unbalanced Fully Generalized Trapezoidal Intuitionistic Fuzzy Transportation Problems. |
| Record Nr. | UNINA-9910484741003321 |
Mishra Akansha
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Intelligent Infrastructure in Transportation and Management : Proceedings of i-TRAM 2021 / / edited by Jiten Shah, Shriniwas S. Arkatkar, Pravin Jadhav
| Intelligent Infrastructure in Transportation and Management : Proceedings of i-TRAM 2021 / / edited by Jiten Shah, Shriniwas S. Arkatkar, Pravin Jadhav |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (297 pages) |
| Disciplina | 388.310285 |
| Collana | Studies in Infrastructure and Control |
| Soggetto topico |
Transportation engineering
Traffic engineering Artificial intelligence Vehicles Information technology - Management Transportation Technology and Traffic Engineering Intelligence Infrastructure Vehicle Engineering Business IT Infrastructure |
| ISBN |
981-16-6936-8
981-16-6935-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Data Driven Approach for Modeling the Mixed Traffic Conditions Using Supervised Machine Learning -- Microscopic traffic simulation approach to evaluate driving parameters at influence zone of the intersection -- Calibrating and Validation of Microsimulation Model for Indian Heterogeneous Traffic Flow - A Case Study -- Driver's Risk Compelling Behavior for Crossing Conflict Area at Three-legged Uncontrolled Intersection -- Analysis Of Driver Behaviour In Dilemma Zone At Signalized Intersection Under Mixed Traffic Condition -- Evaluation of Road Side Friction and Its Effect on Reduction of Capacity of Urban Arterial Roads of Some Selected Towns -- Public Transport User's Satisfaction Level in India -- Real-Time Bus Prediction System in City Transport -- Customer's Perception towards Taxi Management in Kathmandu Valley -- Road crash severity ranking by applying A Multi-criteria decision-making tool: Analytical Hierarchy Process (AHP) -- Digital Eye for Visually Impaired – DEVI -- A Review on Strategic Pavement Maintenance with Machine Learning Techniques -- Intelligent Vehicle Module Using Image Processing -- Opportunistic Sensing based Route Demand Assessment and Feeder Bus Scheduling. |
| Record Nr. | UNINA-9910743359103321 |
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Metaheuristics for logistics . Volume 4 / / Laurent Deroussi
| 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
| 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
| 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
| 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 | ||
| ||
More-for-Less Solutions in Fuzzy Transportation Problems / / by Tanveen Kaur Bhatia, Amit Kumar, Srimantoorao S. Appadoo
| More-for-Less Solutions in Fuzzy Transportation Problems / / by Tanveen Kaur Bhatia, Amit Kumar, Srimantoorao S. Appadoo |
| Autore | Bhatia Tanveen Kaur |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (169 pages) |
| Disciplina |
510
388.310285 |
| Collana | Studies in Fuzziness and Soft Computing |
| Soggetto topico |
Engineering mathematics
Engineering - Data processing Transportation engineering Traffic engineering Operations research Management science Mathematical and Computational Engineering Applications Transportation Technology and Traffic Engineering Operations Research, Management Science |
| ISBN | 3-031-30337-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Acknowledgements -- Contents -- About the Authors -- 1 Introduction -- 1.1 Origin of More-For-Less Solutions of Transportation Problems -- 1.2 Literature Review -- 1.3 Chapter-Wise Summary -- References -- 2 Mehar Method-I to Find All More-For-Less Solutions of Symmetric Fuzzy Balanced Transportation Problems -- 2.1 Some Basic Definitions -- 2.2 Tabular Representation of Crisp Balanced Transportation Problems -- 2.3 Tabular Representation of Symmetric Triangular Fuzzy Balanced Transportation Problems -- 2.4 Crisp Linear Programming Problems Corresponding to Crisp Balanced Transportation Problems -- 2.5 Fuzzy Linear Programming Problems Corresponding to Symmetric Triangular Fuzzy Balanced Transportation Problems -- 2.6 Crisp Balanced Transportation Problems Equivalent to Symmetric Triangular Fuzzy Balanced Transportation Problems -- 2.7 Proposed Sufficient Condition-I for the Existence of at Least One More-For-Less Solution -- 2.8 Proposed Mehar Method-I -- 2.9 Illustrative Examples -- 2.9.1 All More-For-Less Solutions of an Existing Problem -- 2.9.2 All More-For-Less Solutions of Considered Problem -- 2.10 Results and Discussion -- 2.11 Conclusions -- References -- 3 Mehar Method-II to Find All More-For-Less Solutions of Symmetric Fuzzy Transportation Problems with Mixed Constraints -- 3.1 Tabular Representation of Crisp Transportation Problems with Mixed Constraints -- 3.2 Tabular Representation of Symmetric Triangular Fuzzy Transportation Problems with Mixed Constraints -- 3.3 Crisp Linear Programming Problems Corresponding to Crisp Transportation Problems with Mixed Constraints -- 3.4 Fuzzy Linear Programming Problems Corresponding to Symmetric Triangular Fuzzy Transportation Problems with Mixed Constraints.
3.5 Crisp Transportation Problems with Mixed Constraints Equivalent to Symmetric Triangular Fuzzy Transportation Problems with Mixed Constraints -- 3.6 Proposed Sufficient Condition-II for the Existence of at Least One More-For-Less Solution -- 3.7 Proposed Mehar Method-II -- 3.8 All More-For-Less Solutions of Existing Problems -- 3.8.1 All More-For-Less Solutions of the First Problem -- 3.8.2 All More-For-Less Solutions of the Second Problem -- 3.9 Results and Discussion -- 3.9.1 Response of the First Question -- 3.9.2 Response of the Second Question -- 3.9.3 Response of the Third Question -- 3.9.4 Response of the Fourth Question -- 3.10 Conclusions -- References -- 4 Mehar Method-III to Find All More-for-Less Solutions of Symmetric Intuitionistic Fuzzy Transportation Problems with Mixed Constraints -- 4.1 Some Basic Definitions -- 4.2 Extended Arithmetic Operations of Triangular Intuitionistic Fuzzy Numbers -- 4.3 Extended Method for Comparing Triangular Intuitionistic Fuzzy Numbers -- 4.4 Some Important Results -- 4.4.1 Proof of the First Result -- 4.4.2 Proof of the Second Result -- 4.4.3 Proof of the Third Result -- 4.4.4 Proof of the Fourth Result -- 4.5 Tabular Representation of Symmetric Triangular Intuitionistic Fuzzy Transportation Problems with Mixed Constraints -- 4.6 Intuitionistic Fuzzy Linear Programming Problems Corresponding to Symmetric Triangular Intuitionistic Fuzzy Transportation Problems with Mixed Constraints -- 4.7 Crisp Transportation Problem Equivalent to Symmetric Intuitionistic Fuzzy Transportation Problem -- 4.8 Proposed Sufficient Condition-III for the Existence of at Least One More-for-Less Solution -- 4.9 Proposed Mehar Method-III -- 4.10 Illustrative Example -- 4.11 Conclusions -- References. 5 Mehar Method-IV to Find All More-For-Less Solutions of Symmetric Intuitionistic Fuzzy Linear Fractional Transportation Problems with Mixed Constraints -- 5.1 Tabular Representation of Crisp Linear Fractional Transportation Problems with Mixed Constraints -- 5.2 Tabular Representation of Symmetric Triangular Intuitionistic Fuzzy Linear Fractional Transportation Problems with Mixed Constraints -- 5.3 Crisp Linear Fractional Programming Problems Corresponding to Crisp Linear Fractional Transportation Problem with Mixed Constraints -- 5.4 Intuitionistic Fuzzy Linear Fractional Programming Problems Corresponding to Symmetric Triangular Intuitionistic Fuzzy Linear Fractional Transportation Problem with Mixed Constraints -- 5.5 Crisp Linear Fractional Transportation Problem with Mixed Constraints Equivalent to Symmetric Triangular Intuitionistic Fuzzy Linear Fractional Transportation Problem with Mixed Constraints -- 5.6 Proposed Sufficient Condition-IV for the Existence of at Least One More-For-Less Solution -- 5.6.1 Origin of the Sufficient Condition (5.1a) -- 5.6.2 Origin of the Sufficient Condition (5.1b) -- 5.7 Proposed Mehar Method-IV -- 5.8 Illustrative Examples -- 5.8.1 All More-For-Less Solutions of the First Existing Problem -- 5.8.2 All More-For-Less Solutions of the Second Existing Problem -- 5.8.3 All More-For-Less Solutions of the Considered Problem -- 5.9 Results and Discussion -- 5.9.1 Response of the First Question -- 5.9.2 Response of the Second Question -- 5.10 Conclusions -- References -- 6 Some Open Research Problems -- 6.1 First Open Research Problem -- 6.2 Second Open Research Problem -- 6.3 Third Open Research Problem -- 6.4 Fourth Open Research Problem -- 6.5 Fifth Open Research Problem -- References. |
| Record Nr. | UNINA-9910731486603321 |
|
Bhatia Tanveen Kaur
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Resource Transfer Problem : A Framework for Integrated Scheduling and Routing Problems / / by Illa Weiss
| The Resource Transfer Problem : A Framework for Integrated Scheduling and Routing Problems / / by Illa Weiss |
| Autore | Weiss Illa |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (313 pages) |
| Disciplina |
388.310285
658.53 |
| Collana | Contributions to Management Science |
| Soggetto topico |
Operations research
Decision making Management science Engineering economy Calculus of variations Operations Research/Decision Theory Operations Research, Management Science Engineering Economics, Organization, Logistics, Marketing Calculus of Variations and Optimal Control; Optimization |
| ISBN | 3-030-02538-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Elements of Scheduling and Routing Theory -- The Resource Transfer Problem -- Modeling Power of the Framework -- Solution Approach -- Experimental Analysis -- Conclusions. |
| Record Nr. | UNINA-9910337797003321 |
|
Weiss Illa
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The vehicle routing problem / edited by Paolo Toth, Daniele Vigo
| The vehicle routing problem / edited by Paolo Toth, Daniele Vigo |
| Pubbl/distr/stampa | Philadelphia, : SIAM, ©2002 |
| Descrizione fisica | XVIII, 367 p. ; 27 cm. |
| Disciplina |
388.30285
388.310285 |
| Collana | Siam monographs on discrete mathematics and applications |
| Soggetto topico |
Trasporti - Pianificazione - Metodi matematici
Circolazione stradale - Modelli matematici |
| ISBN | 0898714982 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISANNIO-UBO1671095 |
| Philadelphia, : SIAM, ©2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Sannio | ||
| ||