Mosheiov, 1995 - Google Patents
The pickup delivery location problem on networksMosheiov, 1995
- Document ID
- 11095875508505494589
- Author
- Mosheiov G
- Publication year
- Publication venue
- Networks
External Links
Snippet
Abstract The Pickup Delivery Location Problem (PDLP) is a generalization of the Traveling Salesman Location Problem (TSLP) in which the daily tour involves pickup and delivery provided to customers by a vehicle of a given capacity. Two heuristics are suggested: The …
- 108010071441 phenylalanyl-lysyl-phenylalanine 0 abstract description 5
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce, e.g. shopping or e-commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce, e.g. shopping or e-commerce
- G06Q30/02—Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
- G06Q30/0202—Market predictions or demand forecasting
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading, distribution or shipping; Inventory or stock management, e.g. order filling, procurement or balancing against orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
- G06Q10/063—Operations research or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Bögl et al. | The school bus routing and scheduling problem with transfers | |
US7809659B1 (en) | Method for presenting optimal internet keyword based search result sets using an environmental bitmap and environmental bitmap pyramid structure | |
Anily | The vehicle‐routing problem with delivery and back‐haul options | |
Baldacci et al. | An exact algorithm for the traveling salesman problem with deliveries and collections | |
Archetti et al. | Chapter 12: Arc routing problems with profits | |
Mosheiov | The pickup delivery location problem on networks | |
Karimi et al. | Proprietor and customer costs in the incomplete hub location-routing network topology | |
Avella et al. | Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances | |
CN105678493A (en) | Method for establishing multi-level distributing path and multi-level distributing system | |
Cerrone et al. | Grocery distribution plans in urban networks with street crossing penalties | |
Juan et al. | A successive approximations method for the heterogeneous vehicle routing problem: analysing different fleet configurations | |
Cherif-Khettaf et al. | New notation and classification scheme for vehicle routing problems | |
Lysgaard et al. | A matheuristic for the minmax capacitated open vehicle routing problem | |
Archetti et al. | Incomplete service and split deliveries in a routing problem with profits | |
CN107194280B (en) | Model establishing method and device | |
CN109522320A (en) | A kind of optimization method for serving database homomorphic cryptography | |
Caccetta et al. | Branch and cut methods for network optimization | |
Berger | Location-routing models for distribution system design | |
Giannini | Monodromy kernels for strata of translation surfaces | |
Ghaffari-Nasab et al. | Multi-objective capacitated location-routing problem: modelling and a simulated annealing heuristic | |
Araghi et al. | Minisum multipurpose trip location problem on trees | |
Berman et al. | The minisum multipurpose trip location problem on networks | |
US8108409B2 (en) | Determining top combinations of items to present to a user | |
Li et al. | Research on LRP Integration of E‐Commerce Logistics under the Background of Integration of Collection and Distribution | |
Chen et al. | Minimax flow tree problems |