Author
Andreas Bortfeldt
Other affiliations: Rolf C. Hagen Group, FernUniversität Hagen
Bio: Andreas Bortfeldt is an academic researcher from Otto-von-Guericke University Magdeburg. The author has contributed to research in topics: Vehicle routing problem & Routing (electronic design automation). The author has an hindex of 25, co-authored 57 publications receiving 2704 citations. Previous affiliations of Andreas Bortfeldt include Rolf C. Hagen Group & FernUniversität Hagen.
Papers published on a yearly basis
Papers
More filters
TL;DR: A hybrid genetic algorithm for the container loading problem with boxes of different sizes and a single container for loading that uses specific genetic operators based on an integrated greedy heuristic to generate offspring.
303 citations
TL;DR: This work states that container loading problems have been dealt with frequently in the operations research literature and that the proposed approaches are of limited practical value since they do not pay enough attention to constraints encountered in practice.
296 citations
TL;DR: The paper presents a genetic algorithm (GA) for the container loading problem to generate a set of disjunctive box towers and to arrange the box towers on the floor of the container according to a given optimization criterion.
254 citations
TL;DR: In this paper a GA for the 2D-SPP is suggested that works without any encoding of solutions and is subjected to a comprehensive test using benchmark instances with up to 5000 pieces.
228 citations
01 May 2003
TL;DR: This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded with the emphasis on the case of a weakly heterogeneous load.
Abstract: This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Issues in designing parallel and distributed search algorithms for discrete optimization problems, Publication CRT-96-36, Centre de recherche sur les transports, Universitede Montreal, Canada, 1996] i.e., several search paths are investigated concurrently. The parallel searches are carried out by differently configured instances of a tabu search algorithm, which cooperate by the exchange of (best) solutions at the end of defined search phases. The parallel search processes are executed on a corresponding number of LAN workstations. The efficiency of the parallel tabu search algorithm is demonstrated by an extensive comparative test including well-known reference problems and loading procedures from other authors.
192 citations
Cited by
More filters
TL;DR: An improved typology of C&P problems is presented, which is partially based on Dyckhoff’s original ideas, but introduces new categorisation criteria, which define problem categories different from those of Dykhoff.
1,359 citations
TL;DR: The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with G VRP and offer an insight into the next wave of research into GVRp.
Abstract: Green Logistics has emerged as the new agenda item in supply chain management. The traditional objective of distribution management has been upgraded to minimizing system-wide costs related to economic and environmental issues. Reflecting the environmental sensitivity of vehicle routing problems (VRP), an extensive literature review of Green Vehicle Routing Problems (GVRP) is presented. We provide a classification of GVRP that categorizes GVRP into Green-VRP, Pollution Routing Problem, VRP in Reverse Logistics, and suggest research gaps between its state and richer models describing the complexity in real-world cases. The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with GVRP and offer an insight into the next wave of research into GVRP. It is hoped that OR/MS researchers together with logistics practitioners can be inspired and cooperate to contribute to a sustainable industry.
741 citations
Book•
01 Jan 2005
TL;DR: This chapter discusses Metaheuristics and Parallelism in Telecommunications, which has applications in Bioinformatics and Parallel Meta heuristics, and Theory of Parallel Genetic Algorithms, which focuses on the latter.
Abstract: Foreword. Preface Contributors. PART I: INTRODUCTION TO METAHEURISITICS AND PARALLELISM. 1. An Introduction to Metaheuristic Techniques (C. Blum, et al.). 2. Measuring the Performance of Parallel Metaheuristics (E. Alba & G. Luque). 3. New Technologies in Parallelism (E. Alba & A. Nebro). 4. Metaheuristics and Parallelism (E. Alba, et al.). PART II: PARALLEL METAHEURISTIC MODELS. 5. Parallel Genetic Algorithms (G. Luque, et al.). 6. Parallel Genetic Programming (F. Fernandez, et al.). 7. Parallel Evolution Strategies (G. Rudolph). 8. Parallel Ant Colony Algorithms (S. Janson, et al.). 9. Parallel Estimation of Distribution Algorithms (J. Madera, et al.). 10. Parallel Scatter Search (F. Garcia, et al.). 11. Parallel Variable Neighborhood Search (J. Moreno-Perez, et al.). 12. Parallel Simulated Annealing (M. Aydin, V. Yigit). 13. Parallel Tabu Search (T. Crainic, et al.). 14. Parallel Greedy Randomized Adaptive Search Procedures (M. Resende & C. Ribeiro). 15. Parallel Hybrid Metaheuristics (C. Cotta, et al.). 16. Parallel MultiObjective Optimization (A. Nebro, et al.). 17. Parallel Heterogeneous Metaheuristics (F. Luna, et al.). PART III: THEORY AND APPLICATIONS. 18. Theory of Parallel Genetic Algorithms (E. Cantu-Paz). 19. Parallel Metaheuristics Applications (T. Crainic & N. Hail). 20. Parallel Metaheuristics in Telecommunications (S. Nesmachnow, et al.). 21. Bioinformatics and Parallel Metaheuristics (O. Trelles, A. Rodriguez). Index.
592 citations
TL;DR: In this paper, the authors compared the performance of Data Envelopment Analysis (DEA) and Stochastic Frontier Analysis (SFA) on the same set of container port data for the world's largest container ports and compared the results obtained.
Abstract: The efficiency of the container port industry has been variously studied utilising either Data Envelopment Analysis (DEA) or Stochastic Frontier Analysis (SFA). Given the strengths and weaknesses associated with these two approaches, the efficiency estimates and scale properties derived from these analyses are not always convincing. This paper applies both approaches to the same set of container port data for the world’s largest container ports and compares the results obtained. A high degree of correlation is found between the efficiency estimates derived from all the models applied, suggesting that results are relatively robust to the DEA models applied or the distributional assumptions under SFA. High levels of technical efficiency are associated with scale, greater private-sector participation and with transhipment as opposed to gateway ports. In analysing the implications of the results for management and policy makers, a number of shortcomings of applying a cross-sectional approach to an industry characterised by significant, lumpy and risky investments are identified and the potential benefits of a dynamic analysis, based on panel data, are enumerated.
509 citations
TL;DR: This article takes a closer look at the concepts of 64 remarkable meta-heuristics, selected objectively for their outstanding performance on 15 classic MAVRP with different attributes, and leads to the identification of “winning strategies” in designing effective heuristics forMAVRP.
415 citations