Titlebook: Computational Logistics; 13th International C Jesica de Armas,Helena Ramalhinho,Stefan Voß Conference proceedings 2022 The Editor(s) (if ap

opinionated

SLUMP

The Green Sequencing and Routing Problemnstrained multicommodity flows on a space-time network, and we extend a matheuristic approach proposed for the case of only conventional vehicles. Preliminary computational results are also presented.

Phonophobia

https://doi.org/10.1057/9780230372139es. Computational experiments show that the presented procedure finds the optimal solution for randomly generated . instances in less than a millisecond. These instances are the largest QSAP instances for which we could find optimal solutions within several hours’ time.

锯齿状

Studies in Indian Mathematics and Astronomyn 30 real case instances. Solutions provided by the Iterated Greedy are constantly better than the ones implemented by the company, showing that relevant cost reduction can be obtained with a limited computational effort.

neutralize

tooth-decay

Logico-Mathematical Preliminaries,. Given the challenge in solving the problem, we propose a heuristic algorithm to handle it efficiently. We test our model and algorithm on 42 realistic instances accounting for road network distances. Our result show that our heuristic produces high quality results within competitive run times.

可互换

A Self-adaptive Hybrid Search Technique with Its Application to the Quadratic Semi-assignment and Bees. Computational experiments show that the presented procedure finds the optimal solution for randomly generated . instances in less than a millisecond. These instances are the largest QSAP instances for which we could find optimal solutions within several hours’ time.

放纵

Industrial Waste Collection Optimization: A Real-World Case Study in Northern Italyn 30 real case instances. Solutions provided by the Iterated Greedy are constantly better than the ones implemented by the company, showing that relevant cost reduction can be obtained with a limited computational effort.

合唱团

Restenosis

The Long-Haul Transportation Problem with Refueling Deviations and Time-Dependent Travel Time. Given the challenge in solving the problem, we propose a heuristic algorithm to handle it efficiently. We test our model and algorithm on 42 realistic instances accounting for road network distances. Our result show that our heuristic produces high quality results within competitive run times.