CN104715291A - Logistics park site selection method - Google Patents

Logistics park site selection method Download PDF

Info

Publication number
CN104715291A
CN104715291A CN201510134185.XA CN201510134185A CN104715291A CN 104715291 A CN104715291 A CN 104715291A CN 201510134185 A CN201510134185 A CN 201510134185A CN 104715291 A CN104715291 A CN 104715291A
Authority
CN
China
Prior art keywords
logistics
cost
logistics park
park
building
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201510134185.XA
Other languages
Chinese (zh)
Inventor
刘志旗
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Group PLC Is Established In Jiangsu
Original Assignee
Group PLC Is Established In Jiangsu
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Group PLC Is Established In Jiangsu filed Critical Group PLC Is Established In Jiangsu
Priority to CN201510134185.XA priority Critical patent/CN104715291A/en
Publication of CN104715291A publication Critical patent/CN104715291A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a logistics park site selection method. According to the method, a cost budget law is adopted for calculating the total building cost of all logistics parks, and the logistics park candidate site with the least total cost is used as the selected site. Specially, the total cost CL of the building of all the logistics parks is calculated in the following format that CL=Cp+Cr, Cp=CB+CR, and Cr=QL*PL*D. CL is the total building cost of each logistics park, Cp is the fixed cost of building of the logistics park, Cr is transport cost, CB is the new construction cost of the infrastructure of each logistics park, CR is the cost of modifying the original infrastructure of each logistics park, QL is logistics demand, PL is carry rate, and D is the sum of distances between the logistics park and all logistics demand points. The most appropriate site can be effectively selected out from the multiple existing logistics park candidate sites through the method.

Description

Logistics park location method
Technical field
The present invention relates to the planing method of Logistics Park, especially a kind of logistics park location method.
Background technology
The addressing of current most of Logistics Park mainly adopts gravity model appoach to predict, couple together into polygon by logistics demand point straight line, mathematically ask center of gravity to this polygon, namely center of gravity is the addressing of Logistics Park.There are two drawbacks in this method, one hypothesis is too many, first supposes that the distance between logistics demand point and Logistics Park is straight line before the computation, and do not consider how are traffic on the spot and land price.Such logistics park location sometimes can drop in lake, on mountain region, or high land price area, and feasibility is poor.They are two years old, the Logistics Park selected is owing to being polygonal center of gravity, to the shortest point of each demand point distance, and most of polygonal center of gravity all can fall polygonal inside, and the addressing of Logistics Park has particular/special requirement, be not suitable for being placed on down town, therefore, traditional center of gravity site selection model is not suitable for the selection of Logistics Park address.
Summary of the invention
The object of the invention is to overcome the deficiencies in the prior art, a kind of logistics park location method is provided, for existing multiple Logistics Park position candidate point, can effectively select address the most appropriate.The technical solution used in the present invention is:
A kind of logistics park location method, the method adopts cost budgeting method to calculate each Building of Logistics Park total cost, using Logistics Park position candidate point minimum for wherein total cost as addressing point.
Particularly, each Building of Logistics Park total cost C lcalculate respectively by following formula:
C L=C p+C r(1)
C p=C B+C R(2)
C r=Q L*P L*D (3)
Wherein, C lfor Building of Logistics Park total cost, C pfor building the fixed cost of Logistics Park, C rfor communications and transportation cost, C bfor the newly-built cost of Logistics Park infrastructure, C rfor the cost transformed original Logistics Park infrastructure, Q lfor Logistics Demand, P lfor freight rates, D is the distance sum that Logistics Park arrives each logistics demand point.
The invention has the advantages that: cost budgeting method effectively prevent the too much hypothesis of center of gravity addressing point, as utilized the distance between correction factor correction Logistics Park and demand point, next considers communications and transportation cost, as added the improvement cost of original logistic facilities, again, it is a dynamic site selecting method, is taken into account by the Logistics Demand of expection.
Accompanying drawing explanation
Fig. 1 is Logistics Park position candidate point schematic diagram in the embodiment of the present invention.
Embodiment
Below in conjunction with concrete drawings and Examples, the invention will be further described.
As shown in Figure 1, suppose have two Logistics Park position candidate point A and B, C, D, E, F, G to be respectively the main service point of Logistics Park, i.e. logistics demand point.
Use cost budgeting method between A and B to carry out addressing to Logistics Park, suppose C lfor Building of Logistics Park total cost, C pfor building the fixed cost of Logistics Park, C rfor communications and transportation cost, C bfor the newly-built cost of Logistics Park infrastructure, C rfor the cost transformed original Logistics Park infrastructure, Q lfor the Logistics Demand of logistics demand point, P lfor freight rates, D is the distance sum that Logistics Park arrives each logistics demand point.D first according to position candidate point A or B of Logistics Park, apart from the air line distance between each logistics demand point as reference data, then can revise with reference to communications and transportation situation on the spot, finally draws distance comparatively accurately.
Calculate the cost that A, B set up Logistics Park respectively according to following three formula, by comparing, what cost was minimum a bit will become effective addressing point.
C L=C p+C r(1)
C p=C B+C R(2)
C r=Q L*P L*D (3)
Cost is minimum refers to C in each Logistics Park position candidate point lminimum value.The C of each Logistics Park position candidate point lindependent calculating, then compares.

Claims (2)

1. a logistics park location method, is characterized in that: the method adopts cost budgeting method to calculate each Building of Logistics Park total cost, using Logistics Park position candidate point minimum for wherein total cost as addressing point.
2. logistics park location method as claimed in claim 1, is characterized in that:
Each Building of Logistics Park total cost C lcalculate respectively by following formula:
C L=C p+C r(1)
C p=C B+C R(2)
C r=Q L*P L*D (3)
Wherein, C lfor Building of Logistics Park total cost, C pfor building the fixed cost of Logistics Park, C rfor communications and transportation cost, C bfor the newly-built cost of Logistics Park infrastructure, C rfor the cost transformed original Logistics Park infrastructure, Q lfor Logistics Demand, P lfor freight rates, D is the distance sum that Logistics Park arrives each logistics demand point.
CN201510134185.XA 2015-03-25 2015-03-25 Logistics park site selection method Pending CN104715291A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510134185.XA CN104715291A (en) 2015-03-25 2015-03-25 Logistics park site selection method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510134185.XA CN104715291A (en) 2015-03-25 2015-03-25 Logistics park site selection method

Publications (1)

Publication Number Publication Date
CN104715291A true CN104715291A (en) 2015-06-17

Family

ID=53414599

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510134185.XA Pending CN104715291A (en) 2015-03-25 2015-03-25 Logistics park site selection method

Country Status (1)

Country Link
CN (1) CN104715291A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108268962A (en) * 2016-12-30 2018-07-10 香港科技大学深圳研究院 Construction supply chain management method and apparatus based on 4D BIM and GIS
CN111199301A (en) * 2018-11-16 2020-05-26 顺丰科技有限公司 Method, device and equipment for selecting distributed centers and storage medium
CN113762580A (en) * 2021-01-18 2021-12-07 北京京东振世信息技术有限公司 Method and device for determining logistics park for commercial tenant

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108268962A (en) * 2016-12-30 2018-07-10 香港科技大学深圳研究院 Construction supply chain management method and apparatus based on 4D BIM and GIS
CN111199301A (en) * 2018-11-16 2020-05-26 顺丰科技有限公司 Method, device and equipment for selecting distributed centers and storage medium
CN111199301B (en) * 2018-11-16 2024-02-27 顺丰科技有限公司 Method, device, equipment and storage medium for selecting distributed center
CN113762580A (en) * 2021-01-18 2021-12-07 北京京东振世信息技术有限公司 Method and device for determining logistics park for commercial tenant

Similar Documents

Publication Publication Date Title
Morbee et al. Optimised deployment of a European CO2 transport network
Garemo et al. Megaprojects: The good, the bad, and the better
CN107067163A (en) A kind of breakdown maintenance work dispatching method and device
CN102874279B (en) A kind of train route handles method
CN103471603B (en) The matching process of a kind of public bus network and road network and device
CN104881710A (en) Urban express delivering method based on vehicle self-organized network
CN104715291A (en) Logistics park site selection method
Kuby et al. Analysis of cost savings from networking pipelines in CCS infrastructure systems
CN106989754A (en) Multi-mode public transport planning system and method based on public bicycles
CN105277203A (en) Navigation action generation method, navigation method and device
CN104504898A (en) Online map matching method based on floating car data on tunnel road section
CN115752493A (en) Path planning method for electric power fault first-aid repair
CN106855406A (en) A kind of common pilot method based on mobile phone A PP
Pushpanathan ASEAN connectivity and the ASEAN economic community
CN103093686B (en) Method and system of electronic map line marking
CN102868626B (en) A kind of method and system realizing traffic grooming
CN104573067A (en) Tramcar and BRT cable network comprehensive arrangement method
CN104494652A (en) Method for automatically searching optimal route in signal centralizing and locking system
CN106017495A (en) Addressing method based on guideboard relative location encoding and walking navigation method
Kumar Suman et al. Mitigation of overcrowding in buses through bus planning
Krambeck Mapping Manila transit a new approach to solving old challenges
CN204418684U (en) A kind of construction work terrace liner agency
McNeill Splintering volumes: Architecture, engineering, finance, and urban form
Chen Typomorphology and public participation in China F. Chen
DREIJERINK et al. Sustainability and shrinkage: three case studies in Zuid-Limburg (Netherlands)

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20150617

WD01 Invention patent application deemed withdrawn after publication