Sökning: "Large Neighborhood Search"
Visar resultat 1 - 5 av 6 uppsatser innehållade orden Large Neighborhood Search.
1. Workforce Scheduling for Flamman Pub & Disco
Kandidat-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenSammanfattning : Workforce scheduling is widely used within most industries. A well-outlined and efficient schedule gives cost savings, such as reduced number of overtime hours, increases overall utilization, and facilitates meeting demands. LÄS MER
2. Designing a large neighborhood search method to solve a multi-processor avionics scheduling problem
Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenSammanfattning : This thesis introduces a Large Neighborhood Search (LNS) method to solve a multi-processor avionics scheduling problem. In a typical scheduling problem, tasks are scheduled with exact starting times. In this thesis however, tasks will instead be assigned to disjoint time segments, called buckets. LÄS MER
3. The Sequential Sharing Problem in the Future City Logistics by the Multi - purpose Vehicles : An adaptive large neighbourhood search heuristic and formulations for the multi-depot pick-up and delivery problem with time windows, partial-recharging strategies, the fleet sizing and the mixed fleet of single-purpose vehicles and multi-purpose vehicles
Master-uppsats, KTH/TransportplaneringSammanfattning : There are different transportations in the city logistics (e.g., passengers, freights, and wastes), which are handled respectively by single-purpose vehicles (SVs) of the corresponding type. The multi-purpose vehicle (MV) is a future concept whose load modules can be changed for different urban transportations. LÄS MER
4. A Comparative Study on a Dynamic Pickup and Delivery Problem : Improving routing and order assignment in same-day courier operations
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Pickup and Delivery Problems (PDPs) constitute a class of Vehicle Routing Problems (VRPs) consisting of finding the optimal routes for a fleet of vehicles to deliver requests from a set of origin locations to a corresponding set of destinations. PDPs are NP-hard and have a wide variety of variants and potential constraints. LÄS MER
5. Integration of freight transportation in demand responsive transport systems
Master-uppsats, KTH/TransportplaneringSammanfattning : Demand-Responsive Transport (DRT) describes public transport modes, which do not run on a fixed schedule but the customers can order their trip including time windows, origin and destinations themselves. Especially for rural areas with lower demand for passengers, DRT systems seem to be suitable concepts. LÄS MER