外文翻译 外文文献 英文文献 基于互联网的连锁企业的物流管理系统Word格式.docx
《外文翻译 外文文献 英文文献 基于互联网的连锁企业的物流管理系统Word格式.docx》由会员分享，可在线阅读，更多相关《外文翻译 外文文献 英文文献 基于互联网的连锁企业的物流管理系统Word格式.docx（28页珍藏版）》请在冰点文库上搜索。
a
JAVA
Web
applet
equipped
with
interactive
communication
capabilities
between
peripheral
software
tools.The
system
was
developed
distributed
fashion
technology
all
computer
platforms
utilizing
Webbrowser,
focusing
on
detailed
road
network
Athens
the
needs
Central
Food
Market
enterprises.2004
Elsevier
Lt
D.All
rights
reserve
D.
Keywords
:
Decision
support
system;
e-Logistics;
Transportation;
Vehicle
routing
problem
1.Introduction
Enterprise
chains
are
business
model
present
future
regarding
markets
that
involve
small
medium
company
sizes.Clearly,
grouping
activities
towards
a
focused
target
facilitates
understandably
improved
market
penetration
guaranteed
by
successful
trade
mark
leading
fiel
D.Several
collaboration
models
basically
include
franchising
introduced
as
part
this
integrated
process.When
such
is
order
exploit
commercial
idea
or
initiative
subsequently
expanded
grows,
several
issues
arise
operations
entire
network.Such
ideal
place
organizing
evaluating
more
centralized
way
several
ordinary
supply
Infact,
tools
processes
operational
each
individual
company,
can
be
services
provided
tool
offered
each
member
facilitate
transactions
tackle
similarly.Web-based
applications
starting
for
developing
applications.Typically
systems
serve
central
depot
distributing
common
services
field
logistics.The
application
is
stored
server
group.A
prototype
described
previous
work
（Prindezis,
Kiranoudis,
&
Marinos-Kouris,2003）.This
completed
inter
installed
web
deals
integrated
distribution
690
companies
comprise
unique
retail
enterprises.The
underlined
algorithms
within
unified
internet
environment.
The
solved
one
involving
goods
through
fleet
trucks.New
insights
metaheuristics
employed
provide
D.A
characteristic
case
study
presented
to
illustrate
effectiveness
proposed
approach
real-world
of
Athens.
2.Distribution
vehicle
fleets
requires
vehicles
distribute
clients
（Tarantilis,
Vassiliadis,
2003,
2004）.Therefore,
was
designed
automatically
generate
routes
（which
should
de-
liver
which
customers
order）,
rational,
quantitative,
spatial
and
non-spatial
minimizing
simultaneously
cost
total
distance
travelled
vehicles,
subject
following
constraints:
l
has
predetermined
load
capacity,
typically
different
from
other
comprising
（heterogeneous
nature）,
capacity
cannot
exceeded,
single
supplies
demand,
number
used
predetermine
obvious
value
drawn
attention
OR
community.Its
great
success
attributed
fact
it
very
interesting
both
practical
theoretical
points
view.Regarding
point
view,
involved
definitely
plays
central
role
efficiency
planning
level
management,
producing
economical
contribute
reduction
costs,
offering
significant
savings
expenses
（capital,
fuel
driver
salaries）.Its
Importance
level,
motivated
tense
theoretical
development
efficient
algorithms.
For
academic
researchers
professional
societies
OR/MS,
resulting
papers
concerning
Vehicle
Routing
Information
Systems
（VRIS）
problem.The
discussed
NP-hard
optimization
problem,
say
global
optimum
only
revealed
algorithm
exponential
time
or
space
complexity
with
respect
size.Problems
type
dealt
heuristic
techniques.Research
algorithms
（Tarantilis
2001,2002a,
2002b）
has
made
considerable
progress
since
first
were
early
60s.Among
them,
tabu
search
champion
（Laporte,
Gendreau,
Potvin,
Semet,2000）.The
most
powerful
algorithmsare
now
capable
solving
size
even
largesize
instances
extremely
computational
environments
time.On
algorithmic
side,
probably
come
concentrate
faster,
simpler
（with
few
parameters）
robust
algorithms,
if
causes
loss
quality
solution.These
attributes
essential
implemented
package.
beyond
nature.As
mentioned
before,
reveal
guaranteed
optimum,
time
left
propose
solution
utmost
importance
problem.Certainly,
there
trade-off
expected
induction
its
quality.This
straightforward
way.If
asked
user
produce
high
instantly,
then
aggressive
strategy
implemente
D.If
relaxes
obtained,
solution
effciently,
room
elaborate
two
distinct
parts.The
generalized
route
construction
creates
good
subsequent
phase.The
takes
into
account
peculiarities
nature
desire
his
own
desire,
owned
hired,
according
his
daily
needs.
Generalized
Route
Construction
Algorithm
employed,
two-phase
algorithm
where
unrouted
inserted
already
constructed
partial
solutions.The
set
solutions
initially
empty,
seed
route
that
contains
depot.Rival
nodes
examine
All
customers.The
insertion
procedure
utilizes
criteria
c1（i,u,j）
c2（i,u,j）
insert
new
customer
u
two
adjacent
i
j
current
route.The
criterion
finds
best
feasible
（i
*
j
）
minimizes
Clark
Wright
saving
calculation
inserting
node
specific
point,
C1（i,u,j）=d（I,u）+d（u,j）-d（I,j）
（1）
In
formula,
expression
d（k,l）
stands
actual
covering
k
l.The
saving
calculation
phase
serves
strong
intensification
technique
initial
constructions
quality,
component
utmost
necessity
improvement
procedure.
second
identification
best
inserted
nodepair
（i
j
found
（Solomon,
1987）.
From
rival
nodes,
selected
maximizes
expression
C2
u,
j
）=[d（0,u）+d（u,0）]-
C1（i
（2）
0
denotes
node.The
travelling
distance
directly
from/to
to/
additional
expressed
criterion.In
all,
seeks
possible
seeds
when
detected,
inserte
no
found,
route,
containing
depot,
iterates
until
nodes.It
must
stretched
way
filled
up
guided
regarding
utilization
vehicles.That
say,
sorted
dispatcher.Vehicles
（regarding
aspects
availability）
will
loaded
before
others
lower
importance
user.Typically,
users
interviewed
ex
升级会员 