Andere Kunden interessierten sich auch für
![The Multi-Agent Transport Simulation MATSim]( "The Multi-Agent Transport Simulation MATSim")
The Multi-Agent Transport Simulation MATSim92,99 €![Using quantum mechanics to enhance information processing]( "Using quantum mechanics to enhance information processing")
Using quantum mechanics to enhance information processing45,99 €![Intelligent Approaches for Public Transportation Systems]( "Intelligent Approaches for Public Transportation Systems")
Intelligent Approaches for Public Transportation Systems26,99 €![Multi-Agent Systems for Traffic and Transportation Engineering]( "Multi-Agent Systems for Traffic and Transportation Engineering")
Multi-Agent Systems for Traffic and Transportation Engineering195,99 €![From Voices to Results - Voice of Customer Questions, Tools and Analysis]( "From Voices to Results - Voice of Customer Questions, Tools and Analysis")
From Voices to Results - Voice of Customer Questions, Tools and Analysis45,99 €![UX in mobile phones to ensure customer satisfaction and loyalty]( "UX in mobile phones to ensure customer satisfaction and loyalty")
UX in mobile phones to ensure customer satisfaction and loyalty32,99 €![Computational Methods for Transportation Security]( "Computational Methods for Transportation Security")
Computational Methods for Transportation Security50,99 €
Management of logistics distribution networks is a challenging task. Decision-makers rely on logistics assistance systems that recommend actions to optimise the networks. These systems can be based on simheuristics to benefit from metaheuristics in exploring possible solutions and on simulation for modelling the networks. This book presents three approaches to recommend promising solutions to optimise the networks with fewer simulation runs. The first approach utilises information from the network to guide the search of metaheuristics. In this approach, domain-specific information is defined and assigned to actions. The metaheuristic algorithm utilises this domain-specific information to find more-promising solutions. The second approach is reducing the number of possible solutions by grouping actions with respect to their domain-specific attributes. Here, the smaller solution space decreases the number of required simulation runs. The last approach looks for equivalent solutions that cause the same changes in the network. This approach aims to skip unnecessary evaluations and, thus, simulation effort.