Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Exact Models, Heuristics, And Supervised Learning Approaches For Vehicle Routing Problems, Zefeng Lyu
Exact Models, Heuristics, And Supervised Learning Approaches For Vehicle Routing Problems, Zefeng Lyu
Doctoral Dissertations
This dissertation presents contributions to the field of vehicle routing problems by utilizing exact methods, heuristic approaches, and the integration of machine learning with traditional algorithms. The research is organized into three main chapters, each dedicated to a specific routing problem and a unique methodology. The first chapter addresses the Pickup and Delivery Problem with Transshipments and Time Windows, a variant that permits product transfers between vehicles to enhance logistics flexibility and reduce costs. To solve this problem, we propose an efficient mixed-integer linear programming model that has been shown to outperform existing ones. The second chapter discusses a practical …
Computer-Based Methods For Constructing Two-Level Fractional-Factorial Experimental Designs With A Requirement Set, Steven L. Forsythe
Computer-Based Methods For Constructing Two-Level Fractional-Factorial Experimental Designs With A Requirement Set, Steven L. Forsythe
Theses and Dissertations
This dissertation developed four methodologies for computer-aided experimental design of two-level fractional factorial designs with requirement sets (DOE/RS). The requirement sets identify all the experimental factors and the appropriate interaction terms to be evaluated in the experiment. Taguchi graphs and similar manual methods provide techniques for solving the DOE/RS problem. Unfortunately, these methods are limited because they become difficult to use as the number of factors or interaction terms exceeds ten. This research showed that the DOE/RS problem belongs to a class of difficult-to-solve problems known as NP-Complete. It is the combinatorial nature of NP-Complete problems that causes them to …